PROGRAMMING LANGUAGES

PLEASE EXPLAIN YOUR REASONING, SO I UNDERSTAND HOW IT WORKS.

PLEASE EXPLAIN YOUR REASONING, SO I UNDERSTAND HOW IT WORKS.

Consider the following grammar: stmt rightarrow assignment rightarrow subr_call assignment rightarrow id: = expr subr_call rightarrow id (arg_list) expr rightarrow primary expr_tail expr_tail rightarrow op expr rightarrow epsilon primary rightarrow id rightarrow subr_call rightarrow (expr) op rightarrow +|-|*|/arg_list rightarrow expr args_tail rightarrow epsilon Construct a parse tree for the input string foo(a, b). Give a canonical (right-most) derivation of this same string. Prove that the grammar is not LL(1)