converting regex (regular expression) to DFA directly by creating syntax tree in java
-
Updated
Jan 26, 2022 - Java
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
converting regex (regular expression) to DFA directly by creating syntax tree in java
A basic Lexical-Analyzer written in Java.
Bian Yi Yuan Li Shi Jian C--Ci Fa Fen Xi Qi C--lexical-analysis
It is a compiler that do the analyse lexic, sintatic and semantic of the programs in the language LALG.
Exercise about Compiler Construction in NPU
Creating a compiler for my own programming language
UT Trade Compiler: Projects for the Design Compiler Course at the University of Tehran (Fall 2023)
A flexible and customizable complete parser with your manual configuration written with java language and javafx library
Creates a Neo4j graph database from Gavagai Living Lexicon entries
Lexical and Syntax analyzer for Cobra programming language grammar ( an Arabic programming language )
Lexer, parser and interpreter of QB64
Simple compiler for the Tiny BASIC language (grammar in readme) targetting x86-64 Netwide Assembly code, for Linux machines.
Translator description framework for java
A lexical, syntax, and semantic analyzer programmed in Java and designed for our custom programming language, Kaffee. Developed for a university project requirement.
Mini Java Compiler that demonstrates the core phases of compilation: lexical, syntax, and semantic analysis. Built in Java, it supports multiple variable declarations with standard primitive data types (int, float, double, char, boolean, String), handles flexible input spacing, and provides detailed error reporting for issues
A Compiler made using Maven that offers to the user the possibility to provide the language of the compiler .works only on SLR grammars and generates the SLR table according to the grammar given , An SLR parser generator and type checking.
An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD
In this project we created a lexical analyser and a parser for an imaginary programming language called PPLL
compiler course projects to design and implement different parts of a compiler for a new language called FunctionCraft