In theory, given that:
- The LALR parser can be constructed by merging LR(1) states with the same core;
- If $I$ is a LR(1) set of items, then $\text{core}(\text{GOTO}(I))=\text{GOTO}(\text{core}(I))$;
the SLR and LALR automata should be isomorphic.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityIn theory, given that:
the SLR and LALR automata should be isomorphic.