Syntax Analysis8
Consider the CFG with {S, A, B} as the non-terminal alphabet, {a, b} as the terminal alphabet, S as the start symbol and the following set of production rules
| S → bA | S → aB |
| A → a | B → b |
| A → aS | B → bS |
| A → bAA | B → aBB |
Consider the CFG with {S, A, B} as the non-terminal alphabet, {a, b} as the terminal alphabet, S as the start symbol and the following set of production rules
| S → bA | S → aB |
| A → a | B → b |
| A → aS | B → bS |
| A → bAA | B → aBB |
two parse tree.