General algorithm

. Algorithm : Bottom up parsing and translation with inherited attributes

. Inpu t: L attributed definitions

. Output : A bottom up parser

. Assume every non terminal has one inherited attribute and every grammar symbol has a synthesized attribute

. For every production A X ₁ . X _n introduce n markers M ₁ ..M_n and replace the production by

A M ₁ X ₁ ... M _n X _n

M₁ . M _n ε

. Synthesized attribute X_j ,s goes into the value entry of X _j

. Inherited attribute X_j,i goes into the value entry of M _j

General Algorithm for bottom-up parsing and translation with inherited attributes Input. An L-attributed definition with an underlying LL(1) grammar. Output: A bottom up parser that computes the values of all attributes on its parsing stack. Method: Assume every nonterminal A has one inherited attribute, A.i and every grammar symbol X has a synthesized attribute, X.s. For every production A -> X1.Xn introduce n markers M1.Mn and replace the production by A -> M1X1.MnXn. The synthesized attribute Xj.s goes into the value entry of Xj and inherited attribute Xj.i goes into the value entry of Mj .