Modifying the grammar based on Figure 2.25:

• In Figure 2.25, they used LR grammar to obtain a realistic example.
• Figure 2.25 uses a left recursive production for stmt_list.
• Using left recursion allows the parser to break the long statement lists as it goes along, rather than waiting until the entire list is on the stack and then break it from the end.
• It also uses left recursive productions for expr and term.
• These two productions captured using left associativity while keeping an operator and its operands together in the same right-hand side.
• The following grammar shows the use of at least one write statement with grammar provided in Figure 2.25.

program→other_stmt_list write expr stmt_list $$other_stmt_list→other_stmt_list other_stmt | ∈other_stmt→id := expr | read idstmt_list→stmt_list stmt |

Modifying the grammar based on Example 2.17:

• The Example 2.17 shows the recursive descent parser.
• In this method, the execution starts in procedure program. And then the recursive calls are traced out to form a traversal of the parse tree.

program → other_stmt_list writing_stmt stmt_list $$other_stmt_list → other_stmt_list other_stmt | ∈other_stmt → id := expr | read id| if condition then other_stmt_list fi| while condition do other_stmt_list odwriting_stmt → write expr| if condition then other_stmt_list writing_stmt stmt_list fi| while condition do other_stmt_list writing_