Question

Consider the following translation rules for the grammer G:

What is the output produced for the input abebebe using the bottom-up parsing with above translation ?

S $\to$ a (print ''C'') A
A $\to$ b {print ''B''} B
C $\to$ c {print ''R''}
A $\to$ $\in$ {print ''B''}
B $\to$ e {print ''P''} A
B $\to$ $\in$ {print ''A''}

• A. CBPBPBPB
• B. CBBBPPBB
• C. CBPBBPPB
• D. CBBPBPBP

Answer 1

The correct option is A CBPBPBPB

For the input string abebebe

It will print CBPBPBPB.
So, option (c) is correct.