Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dependency injection frameworks such as the Spring framework rely on dynamic language features of Java. Errors arising from the… 
2007
2007
In this paper, we present a novel approach to the parallel implementation of one–pass compilers. Based on attribute grammars, it… 
2000
2000
Argues that a parser generator can be developed that: (1) can bring parser technology within the reach of more software engineers… 
1996
1996
Attribute grammars can be considered as an extension of context-free grammars, where the attributes are associated with grammar… 
1991
1991
PROFIT is a system and a programming language where Prolog is extended with concepts needed in compiler writing applications. The… 
1990
1990
Evaluation of inherited attributes is a problem in conjunction with LR parsing, because the derivation tree is incomplete during… 
1990
1990
TCGS is an acronym for Twente Compiler Generating System. It has been developed at the Compiler Methodology Group at the… 
1990
1990
The parallelization of one-pass compilers is studied systematically. The approach is not restricted to different features in… 
1982
1982
  • R. Wilhelm
  • 1982
  • Corpus ID: 1621030
The L-attributed grammars form an attractive subclass of attribute grammars since the test for L~attributedness is cheap and…