E ! T + E|T T ! V_T|V V ! id Write down the procedures for the nonterminals of the grammar to make a recursive descent parser. [Apr/May 2008,Set3] 4. What is ambiguous grammar? Eliminate ambiguities for the grammar: E ! E + E|E_E|(E)|id. [Apr/May 2008,Set2] UNIT –III Syllabus: Bottom up parsing : Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handling ambiguous grammar, YACC automatic parser generator. – Objectives : To know about shift reduce parsing To understand the LR and LALR parsing Lecture Plan: No. of Lecture date S.No Topic lectures 1 Shift Reduce parsing 1 23-01-2012 2 Shift Reduce parsing 1 25-01-2012 3 LR parsing 1 27-01-2012 4 LALR parsing 1 28-01-2012 5 Error recovery in parsing 1 30-01-2012 6 handling ambiguous grammar 1 01-02-2012 7 YACC automatic parser generator 1 – 02-02-2012
E ! T + E|T T ! V_T|V V ! id Write down the procedures for the nonterminals of the grammar to make a recursive descent parser. [Apr/May 2008,Set3] 4. What is ambiguous grammar? Eliminate ambiguities for the grammar: E ! E + E|E_E|(E)|id. [Apr/May 2008,Set2] UNIT –III Syllabus: Bottom up parsing : Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handling ambiguous grammar, YACC – automatic parser generator. Objectives : To know about shift reduce parsing To understand the LR and LALR parsing Lecture Plan: S.No Topic No. of lectures Lecture date 1 Shift Reduce parsing 1 23-01-2012 2 Shift Reduce parsing 1 25-01-2012 3 LR parsing 1 27-01-2012 4 LALR parsing 1 28-01-2012 5 Error recovery in parsing 1 30-01-2012 6 handling ambiguous grammar 1 01-02-2012 7 YACC – automatic parser generator 1 02-02-2012
Compiler-Design.docx