If LR(0) condition for a grammar G is formulated as follows:Every state is either reduction or a shift state and it can't be both at the same timeif it is a reduction state, it contains exactly one itemand LALR :Every reduction candidate has a look-ahead set disjoint from the set of the terminal labels of the arcs leaving the statein case of multiple reduction candidates, their look-ahead sets are disjointI'm looking for the name (if any) of the LALR subset corresponding to the following conditions:Every reduction candidate has a look-ahead set disjoint from the set of the terminal labels of the arcs leaving the stateEach reduction state contains exactly one reduction candidatewhich is a hybrid between LR(0) and LALR itself.Thank you.
LALR grammars subsets
reference request;fl.formal languages;terminology;grammars;parsing