Tags: Programming Language.

L-attributed grammars are a special type of attribute grammars. They allow the attributes to be evaluated in one depth-first 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. These are a strict superset of S-attributed grammars.

Loading...

This page contains content from the copyrighted Wikipedia article "L-attributed grammar"; that content is used under the GNU Free Documentation License (GFDL). You may redistribute it, verbatim or modified, providing that you comply with the terms of the GFDL.