Question

Name: 3. (10 points) Given grammar: <program> → <stmts> Page: 2 <term> → <var> 1 const 1), write down derivation of: c-5+a 2) What are terminals and what are non-terminals in the grammar? Show a complete parse, including the parse stack contents, input string, and action for the string: id - id + id, using the grammar and parse table below. (10 points) 4. Grammar State id S4 4. T F 5. F (E) R2 S7 R4 R4 R2İR2 Parse table: R4 | R4 S4 R6 R6 R6 10 S6 R1 R3 R3 RS RS S11 R1 R R3 I R3 RSİRS 10

Answer 1

Dear student, according to the question, the answers are as follows:

③Tenminan in ta. rammar stmts abcd stmt expr Non-tesminal var texm Basic one Reduts Enies RT> F

B looti at lhe parse table, we Gan contlude thet, ine Pryse table is belong to LR Parser s Cbotloto up PM ser sj uqut stang parsing poden of an しR parser Corras ponding stutt on tu e Stedk input w od木idt-14 rocav Aclion stark id米idtid ymbols Push 3 suit s sitt S reduce t → EHT pop 6 ive input skiv is Sncenfuly Accepad s hrirg

Thank You, All the best.

If at all any doubts feel free to contact through the comment section.