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
Here are 10 public repositories matching this topic...
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.
compiler
lex
yacc
8086
intermediate-code-generation
shift-reduce-parsers
first-and-follow
lexical-analyser
csl-411
ktu-compiler
compiler-lab-ktu
ktu-lab-programs
-
Updated
Nov 10, 2024 - C
Outputs token stream, symbol table and token table.
-
Updated
Aug 27, 2024 - Python
18CSC304J - Compiler Design course
-
Updated
May 20, 2022 - C
Implementation of an Deterministic Finite Automaton (DFA) in C to tokenize expressions for a simple Calculator (Lexical Analyser).
-
Updated
Feb 13, 2020 - C
Lexical and Syntax analyser for B-- programming language
-
Updated
Jun 3, 2023 - Yacc
C, But Persian keywords can also be used.
-
Updated
Aug 24, 2022 - C
Lexical analyzer that tokenizes code to see if it follows the rules of a certain EBNF grammar
-
Updated
Jun 23, 2022 - Java
Improve this page
Add a description, image, and links to the lexical-analyser topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lexical-analyser topic, visit your repo's landing page and select "manage topics."