Syllabus

JNTUK B.Tech Language Processors (50%FLAT+50%CD) for R13 Batch.

JNTUK B.Tech Language Processors (50%FLAT+50%CD) gives you detail information of Language Processors (50%FLAT+50%CD) R13 syllabus It will be help full to understand you complete curriculum of the year.

Objectives: Describes how a programming language works, how input is converted into output from the machine hardware level and various phases of compiler

UNIT I: Objectives: Delineation of various components of formal languages and grammars, regular expressions and equivalence of finite automata and regular expressions.

Formal Language and Regular Expressions: Languages, operations on languages, regular expressions (re), languages associated with (re), operations on (re), Identity rules for (re), Finite Automata: DFA, NFA, Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis.

UNIT II: Objectives: Illustration of grammars and their role in compilers and various parsing techniques 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. Rightmost Parsers: Shift Reduce Parser, LR (0) Parser, SLR
(1) Parser, LR (1) & LALR (1) Parsers, Ambiguous Grammars.

UNIT III: Objectives: Description of Syntax trees, its variants, language classifications 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.
Semantic Analysis: Semantic Errors, Chomsky hierarchy of languages and recognizers, Type checking, type conversions, equivalence of type expressions.

UNIT IV: Objectives: Focus on various storage allocation schemes Storage Organization: Storage language Issues, Storage Allocation, Storage Allocation Strategies, Scope, Access to Nonlocal Names, Parameter Passing, Dynamics Storage Allocation Techniques.

UNIT V: Objectives: Enforces various schemes for optimizing code Code Optimization: Issues in the design of code optimization, Principal sources of optimization, optimization of basic blocks, Loop optimization, peephole optimization.

UNIT VI: Objectives: Describes the role of code generator and its design issues 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.

Text Books

  • A Text Book on Automata Theory, Nasir S.F.B, P.K. Srimani, Cambridge university Press
  • Introduction to Automata Theory, Formal languages and computation, Shamalendu kandar,
  • Compilers Principles, Techniques and Tools, Aho, Ullman, Ravi Sethi, PEA
  • Introduction to theory of computation, 2nd ed, Michel sipser, CENGAGE
  • Principles of Compiler Design, A.V. Aho . J.D.Ullman; PEA

Reference Books

  • Theory of Computer Science, Automata languages and computation , 2/e, Mishra, Chandra Shekaran, PHI
  • Theory of Computation , aproblem solving approach, kavi Mahesh, Wiley

For more information about all JNTU updates please stay connected to us on FB and don’t hesitate to ask any questions in the comment.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.