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
Patent•
27 Nov 2002
TL;DR: In this article, a graphical user interface may include a form with a plurality of fields, each field associated with a predetermined category, each category may have its own independent, independent, discrete grammar associated therewith, and the independent grammars may be individually activated, simultaneously with their respective categories.
Abstract: A graphical user interface may include a form with a plurality of fields, each field associated with a predetermined category. Each category may have its own, independent, discrete grammar associated therewith, and the independent grammars may be individually activated, simultaneously with their respective categories. In this way, a voice-recognition system that is inputting spoken data for each of the fields may have a restricted grammar to search when attempting to match a particular voice input with an entry for a particular field in the form. Moreover, a global grammar that is active with any one of the independent grammars may be used to move between the fields or perform other high-level functionality not associated with any one of the independent grammars.
270 citations
Journal Article•
TL;DR: It is shown how island grammars can be used to generate robust parsers that combine the accuracy of syntactical analysis with the speed, flexibility and tolerance usually only found in lexical analysis.
Abstract: Source model extraction---the automated extraction of information from system artifacts---is a common phase in reverse engineering tools. One of the major challenges of this phase is creating extractors that can deal with irregularities in the artifacts that are typical for the reverse engineering domain (for example, syntactic errors, incomplete source code, language dialects and embedded languages). This paper proposes a solution in the form of emph{island grammars, a special kind of grammars that combine the detailed specification possibilities of grammars with the liberal behavior of lexical approaches. We show how island grammars can be used to generate robust parsers that combine the accuracy of syntactical analysis with the speed, flexibility and tolerance usually only found in lexical analysis. We conclude with a discussion of the development of Mangrove, a generator for source model extractors based on island grammars and describe its application to a number of case studies.
265 citations
22 Aug 1988
TL;DR: A novel general parsing strategy for 'lexicalized' grammars is discussed and it is argued that even if one extends the domain of locality of CFGs to trees, using only substitution does not give the freedom to choose the head of each structure.
Abstract: In this paper we present a general parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from recent linguistic work in TAGs (Abeille 1988).In our approach elementary structures are associated with their lexical heads. These structures specify extended domains of locality (as compared to a context-free grammar) over which constraints can be stated. These constraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure.We state the conditions under which context-free based grammars can be 'lexicalized' without changing the linguistic structures originally produced. We argue that even if one extends the domain of locality of CFGs to trees, using only substitution does not give the freedom to choose the head of each structure. We show how adjunction allows us to 'lexicalize' a CFG freely.We then show how a 'lexicalized' grammar naturally follows from the extended domain of locality of TAGs and present some of the linguistic advantages of our approach.A novel general parsing strategy for 'lexicalized' grammars is discussed. In a first stage, the parser builds a set structures corresponding to the input sentence and in a second stage, the sentence is parsed with respect to this set. The strategy is independent of the linguistic theory adopted and of the underlying grammar formalism. However, we focus our attention on TAGs. Since the set of trees needed to parse an input sentence is supposed to be finite, the parser can use in principle any search strategy. Thus, in particular, a top-down strategy can be used since problems due to recursive structures are eliminated. The parser is also able to use non-local information to guide the search.We then explain how the Earley-type parser for TAGs can be modified to take advantage of this approach.
264 citations
Book•
01 Jan 1972
TL;DR: In this article, the authors present a book that is a kind of precious book written by an experienced author, and they show the reasonable reasons why you need to read this book.
Abstract: Any books that you read, no matter how you got the sentences that have been read from the books, surely they will give you goodness. But, we will show you one of recommendation of the book that you need to read. This some aspects of text grammars is what we surely mean. We will show you the reasonable reasons why you need to read this book. This book is a kind of precious book written by an experienced author.
261 citations
21 Jun 1989
TL;DR: A relatively simple method is described to derive an evaluation order on the defining attribute occurrences which comprises all possible direct and indirect attribute dependencies.
Abstract: A new kind of attribute grammars, called higher order attribute grammars, is defined. In higher order attribute grammars the structure tree can be expanded as a result of attribute computation. A structure tree may be stored in an attribute. The term higher order is used because of the analogy with higher order functions, where a function can be the result or parameter of another function. A relatively simple method, using OAGs, is described to derive an evaluation order on the defining attribute occurrences which comprises all possible direct and indirect attribute dependencies. As in OAGs, visit-sequences are computed from which an efficient algorithm for attribute evaluation can be derived.
259 citations