Is the following solution for pairwise disjointment correct?
Posted on 2008-10-06
Below I have the following grammer and needed to perform pairwise disjointment. From what I understand I need to calculate the first sets. For each rule find each first letter could be in a
string and use that rule. A sing non-terminal should not have two rules that start
with the same terminal.
Do I have the following correct? And is the fix correct?
A - aB | b | cBB
B -aB |bA |aBb
C- aaA |b|caB
B=a|b|a **not acceptable
B = aY