Let's consider the following grammar: S Ab | Ba A aA | c B bB I d Build the corresponding LL(1) parse table and check if the strings aacb$ and baba are accepted by the parser.