language-icon Old Web
English
Sign In

L-attributed grammar

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. 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. A syntax-directed definition is L-attributed if each inherited attribute of X j {displaystyle X_{j}} on the right side of A → X 1 , X 2 , … , X n {displaystyle A ightarrow X_{1},X_{2},dots ,X_{n}} depends only on

[ "Context-free grammar", "c-command", "Simple LR parser", "Definite clause grammar", "Van Wijngaarden grammar", "logic grammars" ]
Parent Topic
Child Topic
    No Parent Topic