Every S(Synthesized) - attributed definition is L - attributed. For implementing inherited attributed during bottom-up parsing , extends to some, but not LR grammars. Consider the following example
| Production || Semantic Rule |
| S ® L || L. count: = 0 |
| L ® L11 || L. count: = L. count: +1 |
| L ® E || print (L. count) |
In the example above the no terminal L in L ®
E inherits the count of the number of 1’s generated by S. Since the production L ®
E is the first that a bottom-up burser would reduce by, the translator at the time can’t know the number of 1’s in the input. So in a bottom-up evaluation of a syntax directed definition, inherits attributed can’t be evaluated if the definition is L-attributed in the given example. So we can say that L-attributed definition is based on simple LR(1) grammar, but it can’t be implemented always but inherited attributes can be evaluated only if the definition has synthesized attributes.