Java 1-21 Parser and Abstract Syntax Tree for Java with advanced analysis functionalities.

Symbolic regression solver, based on genetic programming methodology.

ProLeap ANTLR4-based parser for Visual Basic 6.0

Using JavaParser (https://github.com/JavaParser/JavaParser), browse and navigate the Abstract Syntax Tree (AST) based on the code in your editor.

Java bindings for tree-sitter

converting regex (regular expression) to DFA directly by creating syntax tree in java

A minimal, Turing-complete, Domain-Specific Language; simple text editor with an interpreter, Abstract Syntax Tree and reduced Control Flow Graph graphical generator.

🔧 My studies on context-free grammar, using ANTLR4 (C++) to generate the parser files. Some basics are developed, such as token processing, recursion, variable definition, array processing, Abstract Syntax Tree (AST) manipulation, UNICODE support, and error handling.

A flexible and customizable complete parser with your manual configuration written with java language and javafx library

A simple interpreted programming language and expression evaluator.

Lexical and Syntax Analyzer for the "Mini" Pascal Language

Generate a string from regex using java. Firstly transfrom regex to nfa to dfa then create a new string from regex

A small but powerful java program for generating complex linguistic syntax trees

Minijava compiler that produces LLVM code. The abstract syntax tree is constructed with the help of JTB.

Compute mathematical expressions via abstract syntax tree. Built with Java and ANTLR4.

A calculator (console application) built with Java using AST (Abstract Syntax Tree)

Compiler Construction contains three phase 1)Lexical Analyzer 2)Syntax Analyzer 3)Semantic Analyzer

Syntax tree method implementation to convert a regular expression to DFA.

Web API to parse expression to Abstract Syntax Tree

Compilateur pour le language L.