GithubHelp home page GithubHelp logo

ftomassetti / javaparser Goto Github PK

View Code? Open in Web Editor NEW

This project forked from javaparser/javaparser

4.0 3.0 3.0 21.37 MB

A clone of the javaparser project, since that seemed dead. All submitted patches are accepted.

Home Page: http://code.google.com/p/javaparser/

License: Other

Java 100.00%

javaparser's Introduction

Java Parser and Abstract Syntax Tree

This package contains a Java 1.8 Parser with AST generation and visitor support.

The AST records the source code structure. You can analyze source code for any purpose. It is possible to change the AST nodes or create new ones to modify the source code.

When you need not only the text from the source code but you also need type information, you can use the Java Symbol Solver project.

Maven Central Build Status Coverage Status Join the chat at https://gitter.im/javaparser/javaparser

Features

  • Light weight
  • Performant
  • Easy to use
  • Modifiable AST
  • Code generation
  • Support of comments

Dependency Management

The project binaries are available in Maven Central. Just add the following to your maven configuration or tailor to your own dependency management system.

Please refer to the Migration Guide when upgrading from 2.5.1

<dependency>
    <groupId>com.github.javaparser</groupId>
    <artifactId>javaparser-core</artifactId>
    <version>3.0.0</version>
</dependency>

How To Compile Sources

If you have checkout the project from GitHub you can build the project with maven using:

mvn clean install

If you checkout the sources and want to view the project in an IDE, it is best to first generate some of the source files; otherwise you will get many compilation complaints in the IDE. (mvn clean install already does this for you.)

mvn javacc:javacc

Manual

Examples of how to use the library can be found on the Manual page of the wiki

Troubleshooting

First try the wiki.

Didn't find an answer? Try searching for existing issues

Still nothing? Open an issue or come chat on Gitter

Javadoc

The libraries javadoc can be found here

History

This parser is based on work by Sreenivasa Viswanadha and Júlio Vilmar Gesser. The original project, now inactive, was originally hosted at Google Code and supported only parsing Java 1.5.

The project now supports parsing Java 1.8 and aims to continue support for features in future versions of the Java language.

Related projects

JavaSymbolSolver is a project from the same committers working on JavaParser. You can use it to calculate the type of JavaParser expressions and connecting references with their declarations.

From JavaParser other projects have been derived:

Credits

This project has been maintained thanks to the joint efforts of many contributors: we are extremely grateful to all of them.

In particular we are thankful to the contributions we received by the Walkmod project which permitted to finalize support for Java 8. The author granted us the permissions to release that code also under the Apache License and we have greatly appreciated that.

License

JavaParser is available either under the terms of the LGPL License or the Apache License. You as the user are entitled to choose the terms under which adopt JavaParser.

For details about the LGPL License please refer to LICENSE.LGPL.

For details about the Apache License please refer to LICENSE.APACHE.

javaparser's People

Contributors

amorozov avatar arouel avatar arturbosch avatar aymandf avatar cdietrich avatar charltonaustin avatar christiansafka avatar clause avatar deepsnowneel avatar dnadolny avatar fftlxyz avatar ftomassetti avatar jahutton avatar javirpo avatar jknack avatar jlleitschuh avatar kiyohome avatar matozoid avatar maxstreichert avatar mschieder avatar olivergondza avatar ptitjes avatar rpau avatar sebastiankirsch avatar smiddypence avatar stepinto avatar svlassiev avatar tanob avatar thejohnfreeman avatar xiewenya avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar

javaparser's Issues

Clean up branches

I've got your repo as a remote, and my branch list is enormous :-D

issue 124 branch - intersection type restriction fails

    @Test
    public void printLambdaIntersectionTypeAssignment() {
        String code = "class A {\n" +
                "  void f() {\n" +
                "    Runnable r = (Runnable & Serializable) (() -> {});\n" +
                "    r = (Runnable & Serializable)() -> {};\n" +
                "    r = (Runnable & I)() -> {};\n" +
                "  }}";
        considerCode(code);

        assertEquals(code, lpp.print(cu));
    }

issue 124 branch - OOM

After a few 1000 files one gets an OOM because of IdentityHashMap.
Looks like PhantomNodeLogic cleanup code is not working properly.
Can that Logic be made part of some enclosing printing structure so that it will be garbage collected when
the printing structure is?

(And the level parameter is not used.)

issue124 branch

Hi again.

(feel free to stop me if this is not helpful (enough/yet))

I copied my small additions to the conrete syntax class of issue124 and gave it a try.
Parsing went through all my files without problems.
Then I switched to

final Pair<ParseResult<CompilationUnit>, LexicalPreservingPrinter> p = LexicalPreservingPrinter.setup( ParseStart.COMPILATION_UNIT, Providers.provider(content)); final String printed = p.b.print(p.a.getResult().get());

Some parsing is REALLY slow now (multiple minutes)

Here a stack trace
java.lang.Thread.State: RUNNABLE at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.inPhantomNode(PhantomNodeLogic.java:39) at com.github.javaparser.printer.lexicalpreservation.PhantomNodeLogic.isPhantomNode(PhantomNodeLogic.java:32) at com.github.javaparser.printer.lexicalpreservation.LexicalPreservingPrinter$2.process(LexicalPreservingPrinter.java:222) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:40) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.ast.visitor.TreeVisitor.visitLeavesFirst(TreeVisitor.java:38) at com.github.javaparser.printer.lexicalpreservation.LexicalPreservingPrinter.storeInitialText(LexicalPreservingPrinter.java:226) at com.github.javaparser.printer.lexicalpreservation.LexicalPreservingPrinter.<init>(LexicalPreservingPrinter.java:121) at com.github.javaparser.printer.lexicalpreservation.LexicalPreservingPrinter.setup(LexicalPreservingPrinter.java:102)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.