Ambiguous Grammar and BNF Grammar in Programming

Programming

Table of Contents
4 (a) Question.............................................................................................................................1
Question 6..................................................................................................................................3
Question 7..................................................................................................................................3

4 (a) Question
The ambiguous grammar can be used for the context free grammar that can be
performed on the string, which can derive the process in two steps, where it can
include the leftmost derivation or the parse tree.
The given equation is,
It is possible to consider the terminal and non-terminal ambiguous variable { x, y, a, b, o, i }.
To find the parse tree, the following is used,
 The left associative process is the production of left recursive function and the
right associative process can be considered for the production of the right
recursive function.
 The ambiguous grammar is the semantic action, which can be used for adding
the parsers and displays the result on the arithmetic operation.
1