All the weekly lab work of the subject 18CSC304J Compiler Design.
-
Updated
May 11, 2022 - C++
All the weekly lab work of the subject 18CSC304J Compiler Design.
Deterministic Finite Automata in C++, Token Parser & Lexer
A tool for LDLf translation to DFA and for LDLf synthesis.
The LALR parser generator (LPG) is a tool for developing scanners and parsers. Supports multi-language . Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
A simple compile time dfa based regular expression library for C++20.
A simple program to create DFAs and test them
Programs covered in compiler design lab (CEN-603)
Programming Languages @ Hanyang Univ.
Built a compiler generator tool which can be supplied with lexical and grammar rules of any programming language and used to generate the lexical and syntax analyzer needed to generate intermediate code.
A proof of concept C++ application for learning regular languages
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
A C++ library to create, load, and analyze Deterministic Finite Automata (DFA) with up to 10 states and lowercase letter alphabets. Offers file loading, state modification, and string acceptance checks.
DFA Minimization
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."