Given the following grammar: <sentence> -> <sentence> <term>| <term> <term> -> <
ID: 3584422 • Letter: G
Question
Given the following grammar:
<sentence> -> <sentence> <term>| <term>
<term> -> <begin> <end>
<begin> -> <begin> <left> | <left>
<end> -> <right> <end> | <right>
<left> -> a| b | c
<right> -> 1 | 2 | 3
Indicate which of the following strings are valid according to this grammar. For those that are valid, construct the parse tree.
ab12c3
In English, describe the strings generated by this grammar as specifically as possible
I already have the valid strings and their respective trees. I need help describing them in English.
Thanks so much
Explanation / Answer
1,4 and 5