Question # 2 Write recursive descent parser for the given grammar (Using Tree Implementation) (Viva +...

Transcribed Image Text:

Question # 2 Write recursive descent parser for the given grammar (Using Tree Implementation) (Viva + Code 5+20) <program> → begin <declare-var> <statement-list> end <statement-list> → <statement> <statement-tail> <statement-tail> →<statement> <statement-tail> <statement-tail>→€ <statement> → <assgn-stmt> | <if-stmt> | <if-else-stmt> <do-stmt> | <while-stmt> <assgn-stmt> → ID <assignment-opr> <expression> ; <do-stmt>→ do (<statement-list>} while (<expression>); <while-stmt> → while (<expression> { <statement-list> } <if-stmt> → if (<expression>) {<statement-list>} <if-else-stmt>→ if (<expression>) (<statement-list>} else {<statement-list>) <expression> → <expression> <logical-or-opr> <expr-1> | <expr-1> <expr-1> <expr-1> <eq-not-eq-opr> <expr-2> | <expr-2> <expr-2> → <expr-2> <greator-less-opr> <expr-3> | <expr-3> <expr-3> → <expr-3> <add-sub-opr> <expr-4> | <expr-4> <expr-4> <expr-4> <mul-div-opr> <expr-5> | <expr-5> <expr-5> → ID NUMBER | (<expression>) Question # 2 Write recursive descent parser for the given grammar (Using Tree Implementation) (Viva + Code 5+20) <program> → begin <declare-var> <statement-list> end <statement-list> → <statement> <statement-tail> <statement-tail> →<statement> <statement-tail> <statement-tail>→€ <statement> → <assgn-stmt> | <if-stmt> | <if-else-stmt> <do-stmt> | <while-stmt> <assgn-stmt> → ID <assignment-opr> <expression> ; <do-stmt>→ do (<statement-list>} while (<expression>); <while-stmt> → while (<expression> { <statement-list> } <if-stmt> → if (<expression>) {<statement-list>} <if-else-stmt>→ if (<expression>) (<statement-list>} else {<statement-list>) <expression> → <expression> <logical-or-opr> <expr-1> | <expr-1> <expr-1> <expr-1> <eq-not-eq-opr> <expr-2> | <expr-2> <expr-2> → <expr-2> <greator-less-opr> <expr-3> | <expr-3> <expr-3> → <expr-3> <add-sub-opr> <expr-4> | <expr-4> <expr-4> <expr-4> <mul-div-opr> <expr-5> | <expr-5> <expr-5> → ID NUMBER | (<expression>)

Answer rating: 100% (QA)

class Node def initself data selfdata data selfchildren class Parser def initself tokens selftokens tokens selfindex 0 def programself node Nodeprogra... View the full answer