Theory of Computation,Overview of DFA,NFA,PDA,CFG, Turing Machine,Pumping Lemma,Regular Language, Context Free Language, Context Sensitive Language, Recursively Enumerable Language, Chomsky Normal Form.It is a subject in GTU Engineering CE semester - VI. Here you can Find GATE Papers for Computer Science,Assignment, Question Paper, Important Questions,GTU Paper, Exam material,Exercise Solution, Handwritten Material,Tutorial, Classnote, Class Test, Solution, Reading Material, For IGNOU Students
The Context Free Grammar is an Essential Concept for the implementation of compiler and other programming Language Processor.Tools such as YACC take a CFG as input and produce a Parser, the component of a compiler that deduce the structure of the program being compiled.Suppose that G is a Context Free Grammar over an Alphabet Σ. To Parse a string x є Σ* is often useful.Parsing a statement in a programming Language, for example, is necessary in order to classify it according to syntax.Parsing an algebraic expression is essentially what allows us to evaluate the expression.There are main two different way of parsing.
(1) Top Down Parsing
(2) Bottom Up Parsing