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.
Exercise about Compiler Construction in NPU
天津大学(TJU)软件工程编译原理结课大作业 C--词法分析器 C--lexical-analysis
Creating a compiler for my own programming language
It is a compiler that do the analyse lexic, sintatic and semantic of the programs in the language LALG.
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
A lexical, syntax, and semantic analyzer programmed in Java and designed for our custom programming language, Kaffee. Developed for a university project requirement.
Lexical and Syntax analyzer for Cobra programming language grammar ( an Arabic programming language )
Translator description framework for java
Simple compiler for the Tiny BASIC language (grammar in readme) targetting x86-64 Netwide Assembly code, for Linux machines.
A handmade compiler for MiniJava, a subset of Java, using JavaCC, JTB, LLVM.
CAU 2020 Compilers Project - Lexical and Syntax Analyzer
In this project we created a lexical analyser and a parser for an imaginary programming language called PPLL
This project was an assignment for the class : Compiler Construction 1 (srb. Programski Prevodioci 1). Please read the README.md file for more info.
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
Toy compiler for a subset of Java
Lexer, parser and interpreter of QB64