Posted inCompiler Design
Context-Free GRAMMARS
A Context-Free Grammar is a quadruple that consists of terminals,non-terminals, start symbol and productions. Terminals: These are the basic symbols from…
Posted inCompiler Design
Error Handling in Compiler Design
The tasks of the Error Handling process are to detect each error, report it to the user,…
Posted inCompiler Design
Types of Parsing
Syntax analyzers follow production rules defined by means of context-free grammar. The way the production…
Posted inCompiler Design
THE ROLE OF PARSER
The parser or syntactic analyzer obtains a string of tokens from the lexical analyzer and…
Posted inCompiler Design
Syntax Analysis
Syntax analysis or parsing is the second phase of a compiler. In this chapter, we…
Posted inCompiler Design
Minimization of DFA
DFA minimization stands for converting a given DFA to its equivalent DFA with minimum number…
Posted inCompiler Design
Regular Expressions
The lexical analyzer needs to scan and identify only a finite set of valid string/token/lexeme…
Posted inCompiler Design
Finite Automata
Finite automata is a state machine that takes a string of symbols as input and…
Posted inCompiler Design
RECOGNITION OF TOKENS
Consider the following grammar fragment: stmt → if expr then stmt | if expr then…
Posted inCompiler Design
SPECIFICATION OF TOKENS
There are 3 specifications of tokens: 1)Strings 2) Language 3)Regular expression Strings and Languages · An alphabet or character…