Topic
L-attributed grammar
About: L-attributed grammar is a research topic. Over the lifetime, 2541 publications have been published within this topic receiving 58591 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2010
TL;DR: This chapter treats different parsing techniques for TAG, i.e., a CYK parser, different types of Earley algorithms and LR parsing for TAG.
Abstract: This chapter treats different parsing techniques for TAG. We will extend the standard algorithms for CFG, i.e., present a CYK parser, different types of Earley algorithms and LR parsing for TAG.
01 Jan 2023
TL;DR: For modelling agents and their actions, as well as their interactions with the environment, eco-array Grammars (multilevel n-dimensional parallel array grammars) are proposed.
Abstract: For modelling agents and their actions, as well as their interactions with the environment, we propose eco-array grammars (multilevel n-dimensional parallel array grammars). Even complex system behavior can be captured by adding attributes to this syntactic description model.
01 Jan 2004
TL;DR: In this paper, the authors propose a development environment for language processors based on the formalism of attribute grammars (AGs), which is an extension of AGs that allows both circularity of attribute dependency and remote attribute references.
Abstract: To develop language processors efficiently is difficult because they need to deal with large data with complex structures. Using tools based on formal specification is one of the strategies to reduce the cost in developing language processors. However, the area of application which can be developed by these tools is limited. This dissertation aims at realization of the practical development environment for language processors based on the formalism of attribute grammars (AGs). AGs are a formalism that integrates syntax and semantics of languages. AGs have several advantages for development of language processors in that the formalization is intuitive and clear, and that attribute evaluators are automatically obtained from descriptions. However, the following disadvantages make it difficult to develop language processors by AGs: (1) difficulty in direct application of the pure (standard) AG formalism to tools because of the weak computation power, and (2) complication in debugging of AG descriptions, which arises from the difficulty specific to AGs. To overcome the first problem, we proposed circular remote attribute grammars (CRAGs), an extension of AGs that allows both circularity of attribute dependency and remote attribute references. We also showed a way to obtain efficient evaluators for CRAGs. By this research any control structure of the subject language can be treated and circularities of attribute dependency are allowed in AGs. As a result, stronger expressive power is obtained and efficient attribute evaluators are developed. For the second problem, the generalized framework for systematic debugging of AGs was proposed, which allows several forms of query and enables integration of various query based methods. This reduces the complication in debugging of AG descriptions. These accomplishments widen the application area of attribute grammar based software, which improves the development environment for language
01 Jan 1986
TL;DR: In this article, the authors considered EOL grammars as tree generating mechanisms and showed that the set of 2,3-trees can be generated by EOL Grammars.
Abstract: We consider EOL grammars as tree generating mechanisms. This leads to questions of height, weight, and structural equivalence of EOL grammars. Height equivalence is solved completely, weight equivalence remains open, and structural equivalence is solved for three special cases. We characterize those EOL grammars which generate exactly the set of 2,3-trees.