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.

A simple compile time dfa based regular expression library for C++20.

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.

Finite-State Machine (FSM) for Arduino

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.

Regular Expression Engine which Uses NFAs and DFAs to Match Regular Expression

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.

Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.

Principles of Compiler Design Programs

Implementing a simple database kernel

finite state machine or deterministic finite automata in c++20 template

🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.

This is the "one": Linuxy infrastructureish mostly C++ code.

A command line tool for converting simple regex to minimized dfa and cyk simulation

🎁A toy-regex use follow set and DFA

The LALR parser generator (LPG) is a tool for developing scanners and parsers written in TypeScript ,C#, Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.

Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)