Learn More
Storage optimization is considered for evaluators of simple multivisit, or (ℓ-)ordered, attribute grammars. A necessary and sufficient condition is formulated which has to be satisfied by such an evaluator to enable it to store the instances of a given attribute on a global stack. A simple algorithm is given that decides this condition in polynomial time. A(More)
  • 1