1. Modify the following BNF grammar to EBNF -> begin end -> | ; -> =...

 

Transcribed Image Text:

1. Modify the following BNF grammar to EBNF <program> -> begin<stmt_list> end <stmt_list> -> <stmt> |<smt>; <stmt_list> <stmt> -> <var> = <expr> <Expr> -> <var> + <var> |<var> - <var> |<var> <if_stmt> -> if<logic_expr>then<stmt> | if<logic_expr>then<stmt> else <stmt> 1. Modify the following BNF grammar to EBNF <program> -> begin<stmt_list> end <stmt_list> -> <stmt> |<smt>; <stmt_list> <stmt> -> <var> = <expr> <Expr> -> <var> + <var> |<var> - <var> |<var> <if_stmt> -> if<logic_expr>then<stmt> | if<logic_expr>then<stmt> else <stmt>

Answer rating: 100% (QA)

To convert the given BNF grammar to EBNF we can introd... View the full answer