Language Processing system Compilers & Assemblers

Model of A Compiler

Phases of a Compiler Lexical Analyzer Syntax Analyzer Semantic Analyzer / Analysis Intermediate Code Generation Code Optimization Code Generation

Data structures used / Data Structure used in complier design Error Handler

Passes of a compiler

Key Components Operations on Languages Regular Expressions Algebraic laws of Regular Expression Regular Definition Transition Diagram Finite Automata Representation of Finite Automata / Finite state Automata Solved Examples DFA / Deterministic Finite Automaton Additional Problems to Solve Subset Construction Method Minimization of DFA Equivalence of DFA

Context Free Grammar Derivation Elimination of Left Recursion Elimination of Left Factoring

Parsers / Parser tree Top Down Parsers Bottom Up Parsers LL(1) Parser

Advance Concrete Technology

Previous Page

Next Page

NFA

Construct NFA with its transition graph and transition table for the Regular expression
(a| b)* abb

Transition graph

Transition table

Construct NFA with its transition graph and transition table for the language that accepts a set of all strings that ends with 1.
Here , Σ= {0,1}
RE=(0 |1)*1

Transition graph

Transition table

Construct the NFA for the language that accepts a set of all strings that starts with 11.
Here , Σ= {0,1}
RE= 1 1 (0 |1) *

Transition graph

Transition table

Construct NFA with its transition graph and transition table for the language that accepts a set of all binary strings of length 2
Here , Σ= {0,1}
RE=(0 |1) (0|1)

Transition graph

Transition table

Construct NFA with its transition graph and transition table for the language that accepts a set of all binary strings that ends with 00 or 11.
Here , Σ= {0,1}
RE=(0 |1)*(00|11)

Transition graph

Transition table

Previous Page

Next Page