L-attributed grammar

From Wikipedia, the free encyclopedia

You have new messages (last change).

L-attributed grammars are a special type of attribute grammars. They allow the attributes to be evaluated in one left-to-right traversal of the abstract syntax tree. As a result, attribute evaluation in L-attributed grammars can be incorporated conveniently in top-down parsing. Many programming languages are L-attributed. Special types of compilers, the narrow compilers, are based on some form of L-attributed grammar.

Retrieved from "http://en.wikipedia.org../../../l/-/a/L-attributed_grammar.html"
In other languages