Language Processing system

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

Language Processing system

Previous Page

Next Page

Language Processing System:

Computers are electronic devices that can understand only machine language. The machine language comprises 0's and 1’s and is also called the machine code.
Any program written in high level language should be converted to machine language for the computer to understand. The language translators serve this purpose.
Examples of language translators include compiler, interpreters, assemblers.
The source program is the High Level Programming language and the target program is the Machine Language.
The steps involved in the language processing system is shown below
Figure 1: Language Processing System

Previous Page

Next Page