Starting with the CFSM built in Exercise 4, compute the LALR(1) look ahead information. Compare the resulting LALR(1)machine with the machine obtained in Exercise 31
Exercise 31
Define the quasi-identical states of an LR(1) parsing machine to be those states whose kernel productions are identical. Such states are distinguished only by the look ahead symbols associated with their productions. Given the LR(1) machine built for Exercise 30, do the following.
(a) List the quasi-identical states of the LR(1) machine.
(b) Merge each set of quasi-identical states to obtain an LALR(1) machine.
Exercise 30
Show the LR(1) construction for the grammar in Exercise 4.
Exercise 4
Build the CFSM for the following grammar.
