Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.
1.1 Formal Language and Regular Expressions: Languages, operations on languages
1.2 Regular expressions (re), languages associated with (re), operations on (re), Identity rules for (re)
1.3 Finite Automata: DFA, NFA, Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis
2.1 Context Free grammars and parsing: Context free Grammars, Leftmost Derivations, Rightmost Derivations, Parse Trees, Ambiguity Grammars, Top-Down Parsing, Recursive Descent Parsers: LL(1) Parsers.
2.2 Rightmost Parsers: Shift Reduce Parser, LR (0) Parser, SLR (1) Parser, LR (1) & LALR (1) Parsers, Ambiguous Grammars
3.1 Syntax Directed Translation: Definitions, construction of Syntax Trees, S-attributed and L attributed grammars, Intermediate code generation, abstract syntax tree, translation of simple statements and control flow statements.
3.2 Semantic Analysis: Semantic Errors, Chomsky hierarchy of languages and recognizers, Type checking, type conversions, equivalence of type expressions.
4.1 Storage Organization: Storage language Issues, Storage Allocation, Storage Allocation Strategies, Scope, Access to Nonlocal Names, Parameter Passing, Dynamics Storage Allocation Techniques.
5.1 Code Optimization: Issues in the design of code optimization
5.2 Principal sources of optimization, optimization of basic blocks, Loop optimization, peephole optimization
6.1 Code Generation: Issues in the design of code Generation, Machine Dependent Code Generation, object code forms, Register allocation and assignment, DAG representation of basic Blocks, Generating code from DAGs.
No Preview is available for this book
CategoriesInformation Technology
Format EPUB
TypeeBook