Question

1. Check the CFG below: S? aAB | bA | ? A ? aAb | ? B ? bB | c [10] Analyze if above CFG is LL(1), SLR(1), CLR(1) and LALR(1) by parsing the input string \"aabc\". You must show the complete process for checking the parsing techniques. For example, to check if the grammar is SLR(1) or not, you should first create the LR(0) items then the SLR(1) parsing table. If there is no conflict in the parsing table, parse the input string aabc with the help of the parsing table. Follow this process for the rest of the parsers. Also explain which parsing technique will be the most efficient.

          1. Check the CFG below:
S? aAB | bA | ?
A ? aAb | ?
B ? bB | c
[10]
Analyze if above CFG is LL(1), SLR(1), CLR(1) and LALR(1) by parsing the input string
\"aabc\". You must show the complete process for checking the parsing techniques.
For example, to check if the grammar is SLR(1) or not, you should first create the LR(0) items
then the SLR(1) parsing table. If there is no conflict in the parsing table, parse the input string
aabc with the help of the parsing table. Follow this process for the rest of the parsers.
Also explain which parsing technique will be the most efficient.

1. Check the CFG below:
S? aAB | bA | ?
A ? aAb | ?
B ? bB | c
[10]
Analyze if above CFG is LL(1), SLR(1), CLR(1) and LALR(1) by parsing the input string
äabc.̈ You must show the complete process for checking the parsing techniques.
For example, to check if the grammar is SLR(1) or not, you should first create the LR(0) items
then the SLR(1) parsing table. If there is no conflict in the parsing table, parse the input string
aabc with the help of the parsing table. Follow this process for the rest of the parsers.
Also explain which parsing technique will be the most efficient.

Added by Lynn B.

Question

Please give Ace some feedback