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

Assume p, q, r are used in representing regular expressions, then the following algebraic laws holds true.

Union is Commutative	p \| q = q \| r
Union is Associative	p \| (q \| r) = (p \| q) \| r
Concatenation is associative	p (qr) = (pq) r
Concatenation distributive over union	p (q \| r) = pq \| pr (p \| q) r = pr \| qr
Identity for concatenation	εp = p ε = p
Closure	r= (r \| ε)

Previous Page

Next Page