2 Consider the following context free grammar G with brules, which has the set of terminals T = {stmt, & }, ;'s. This gr

[answerhappygod]

2 Consider The Following Context Free Grammar G With Brules Which Has The Set Of Terminals T Stmt S This Gr 1 (100.58 KiB) Viewed 59 times

2 Consider the following context free grammar G with brules, which has the set of terminals T = {stmt, & }, ;'s. This grammar describes the organization of statements in blocks for a programming language. Blocks can have zero or more statements and other nested blocks, seperated by semicolons. (P is the start symbol here.) fictious P S S-2 stmt | { B B ³ 1 5 3 1 S; B by using suitable productions, show a derivation of the string {√ { stmt; stmt }; } from the grammar G. Indicate the rule number used in each step. NOTE" that "stmt" is considered to be single terminal in the a grammar