SLR(1) and LALR(1) and Reduce
问题 I confused Exactly !!!!!! I read following example in one of my professor note. 1) we have a SLR(1) Grammar G as following. we use SLR(1) parser generator and generate a parse table S for G. we use LALR(1) parser generator and generate a parse table L for G. S->AB A->dAa A-> lambda (lambda is a string with length=0) B->aAb Solution: the number of elements with R (reduce) in S is more than L. but in one site i read: 2) Suppose T1, T2 is created with SLR(1) and LALR(1) for Grammar G. if G be a