Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.
-
Updated
Jul 12, 2020 - C#
Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.
This repository contains all the necessary programs and solutions for the KTU Compiler Lab. Ideal for KTU University students, this collection covers each lab experiment, code examples, and explanations as per the official syllabus.
18CSC304J - Compiler Design course
Implementation of an Deterministic Finite Automaton (DFA) in C to tokenize expressions for a simple Calculator (Lexical Analyser).
Outputs token stream, symbol table and token table.
C, But Persian keywords can also be used.
Lexical and Syntax analyser for B-- programming language
Lexical analyzer that tokenizes code to see if it follows the rules of a certain EBNF grammar
Add a description, image, and links to the lexical-analyser topic page so that developers can more easily learn about it.
To associate your repository with the lexical-analyser topic, visit your repo's landing page and select "manage topics."