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.

Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.

18CSC304J - Compiler Design course

Implementation of an Deterministic Finite Automaton (DFA) in C to tokenize expressions for a simple Calculator (Lexical Analyser).

A Lexycal Analyzer for the Pep9 Assembler

Outputs token stream, symbol table and token table.

C, But Persian keywords can also be used.

Redirect to LexicalAnalyser Documentation page

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