GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) Theory of Computation-Context Free Languages and Push-Down Automata Study Material (Page 11 of 17)

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Greibach Normal Form: The Production Rule

Edit

The Production Rule

The production rule and is not in GNF, so we substitute in the production rule and as follows,

Now we will remove …

… (1338 more equations) …

Subscribe (by clicking here) to view full notes and track progress.

Ambiguity

Edit

Ambiguity

A grammar is said to be ambiguous if there exists more than one leftmost derivation or more than one rightmost derivation or more than one parse tree for the given input string. If the grammar is not ambiguous, then it is called unambiguous.

On the basis of number of derivation trees, the grammars are classified as,

Image Shows Types of Grammer

If the grammar has ambiguity, then it is not good for c…

… (339 more words, 22 figures) …

Subscribe (by clicking here) to view full notes and track progress.