Compiler Design 9 min read
Syntax Analysis
Syntax analysis or parsing is the second phase of a compiler. In this chapter, we shall learn the basic concepts…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Compiler Design 4 min read
Minimization of DFA
DFA minimization stands for converting a given DFA to its equivalent DFA with minimum number of states. Minimization of DFASuppose…
Compiler Design 3 min read
Regular Expressions
The lexical analyzer needs to scan and identify only a finite set of valid string/token/lexeme that belong to the language…
Compiler Design 2 min read
Finite Automata
Finite automata is a state machine that takes a string of symbols as input and changes its state accordingly. Finite…
Compiler Design 1 min read
RECOGNITION OF TOKENS
Consider the following grammar fragment: stmt → if expr then stmt | if expr then stmt else stmt | ε…
Compiler Design 4 min read
SPECIFICATION OF TOKENS
There are 3 specifications of tokens: 1)Strings 2) Language 3)Regular expression Strings and Languages · An alphabet or character class is a finite set…
Compiler Design 2 min read
Tokens
Lexemes are said to be a sequence of characters (alphanumeric) in a token. There are some predefined rules for every…
Compiler Design 3 min read
Input Buffering in Compiler Design
The lexical analyzer scans the input from left to right one character at a time. It uses two pointers begin…
Compiler Design 1 min read
Roles of the Lexical analyzer
Lexical analyzer performs below given tasks: Helps to identify token into the symbol table Removes white spaces and comments from…
General Concepts 9 min read
Starting & Reversing Problems in Marine Engines
There are a number of reasons for starting and reversing problems in marine engines. This malfunction is one of the…