Results 11  20
of
27
A Parsing Algorithm That Extends Phrases
, 1980
"... This paper presents an algorithm that does this in two ways, one dealing with "right extension" and the other with "left recursion". A brief comparison with other parsing algorithms shows it to be related to the leftcorner parsing algorithm, but it is more flexible in the order that it permits phras ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper presents an algorithm that does this in two ways, one dealing with "right extension" and the other with "left recursion". A brief comparison with other parsing algorithms shows it to be related to the leftcorner parsing algorithm, but it is more flexible in the order that it permits phrases to be combined. It has many of the properties of the sentence analyzers of Marcus and Riesbeck, but is independent of the language theories on which those programs are based.
Modularity and Information Content Classes in PrincipleBased Parsing
 COMPUTATIONAL LINGUISTICS
, 1995
"... This paper investigates one problem related to the tension between building linguistically based parsers and building efficient ones. In particular, the issue of what is a linguistically motivated way of deriving a parser from principlebased theories of grammar is explored. It is argued that an eff ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper investigates one problem related to the tension between building linguistically based parsers and building efficient ones. In particular, the issue of what is a linguistically motivated way of deriving a parser from principlebased theories of grammar is explored. It is argued that an efficient and faithful parser can be built by taking advantage of the way in which principles are stated. To support this claim, two features of an implemented parser are discussed. First, configurations and lexical information are precompiled separately into two tables (an table and a table of lexical cooccurrence) which gives rise to more compact data structures. Secondly, precomputation of syntactic features (Oroles, case, etc.) results in efficient computation of chains, because it reduces several problems of chain formation to a local computation, thus avoiding extensive search of the tree for an antecedent or extensive backtracking. It is also shown that this method of building longdistance dependencies can be computed incrementally
Does osubstitution preserve recognizability?
 IN PROC. 11TH INT. CONF. IMPLEM. AND APPL. OF AUTOMATA
, 2006
"... Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that osubstitution preserves reco ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that osubstitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent, commutative, and continuous. This result is applied to prove that the range of the otts transformation computed by a linear recognizable tree series transducer is pointwise recognizable.
Models of Tree Translation
"... This first chapter gives an introduction into the area of tree transducer theory, and describes the results presented in Chapters 2–6. The first section addresses general issues like translations, trees, and tree grammars. Section 2 is concerned with the different models of tree transducers that ar ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This first chapter gives an introduction into the area of tree transducer theory, and describes the results presented in Chapters 2–6. The first section addresses general issues like translations, trees, and tree grammars. Section 2 is concerned with the different models of tree transducers that are considered in the thesis. It describes the typical problems that appear in tree transducer theory, and mentions important properties of the different tree transducer models. Section 3 describes the results of
Algebraic Languages: A Bridge Between Combinatorics and Computer Science
, 1994
"... We describe the classical Schützenberger methodology and two extensions: grammars with operators and qgrammars. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We describe the classical Schützenberger methodology and two extensions: grammars with operators and qgrammars.
Compilerbased Implementation of SyntaxDirected Functional Programming
 Aachen University of Technology
, 1991
"... We consider particular functional programs in which on the one hand the recursion is restricted to syntaxdirected recursion and on the other hand simultaneous recursion and nesting of function calls in parameter positions of other functions is allowed. For such programs called syntaxdirected funct ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We consider particular functional programs in which on the one hand the recursion is restricted to syntaxdirected recursion and on the other hand simultaneous recursion and nesting of function calls in parameter positions of other functions is allowed. For such programs called syntaxdirected functional programs, we formalize a compilerbased implementation of the callby name computation strategy. The machine involved in this implementation, called syntaxdirected runtimestack machine, is minimal in the sense that it computes exactly the class sdFun of functions which are expressible by syntaxdirected functional programs. We verify this minimality property by showing a onetoone correspondence between the implementation presented in this paper, and an interpreterbased implementation of syntaxdirected functional programs on checkingtree nestedstack transducers. It is known from the literature that such transducers characterize in a formal sense the class sdFun. The work of thi...
Abstract Interpretation and Attribute Grammars
, 1992
"... The objective of this thesis is to explore the connections between abstract interpretation and attribute grammars as frameworks in program analysis. Abstract interpretation is a semanticsbased program analysis method. A large class of data flow analysis problems can be expressed as nonstandard sem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The objective of this thesis is to explore the connections between abstract interpretation and attribute grammars as frameworks in program analysis. Abstract interpretation is a semanticsbased program analysis method. A large class of data flow analysis problems can be expressed as nonstandard semantics where the “meaning ” contains information about the runtime behaviour of programs. In an abstract interpretation the analysis is proved correct by relating it to the usual semantics for the language. Attribute grammars provide a method and notation to specify code generation and program analysis directly from the syntax of the programming language. They are especially used for describing compilation of programming languages and very efficient evaluators have been developed for subclasses of attribute grammars. By relating abstract interpretation and attribute grammars we obtain a closer connection between the specification and implementation of abstract interpretations which at the same time facilitates the correctness proofs of interpretations. Implementation and specification of abstract interpretations using circular attribute grammars is realised with an evaluator system for a class of domain theoretic attribute grammars. In this system thecircularity of attribute grammars is resolved by fixpoint iteration. The use of finite lattices in abstract interpretations requires automatic generation of specialised fixpoint iterators. This is done using a technique called lazy fixpoint iteration which is presented in the thesis. Methods from abstract interpretation can also be used in correctness proofs of attribute grammars. This proof technique introduces a new class of attribute grammars based on domain theory. This method is illustrated with examples. i ii SUMMARY
Some Topics in Parser Generation
"... This paper discusses three aspects of the parser generation algorithm: support of separate compilation of parts of the resulting parsers, a static and a dynamic method for resolving conflicts, and the errorcorrection method of the resulting parsers. Before discussing these topics, we give a short ov ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper discusses three aspects of the parser generation algorithm: support of separate compilation of parts of the resulting parsers, a static and a dynamic method for resolving conflicts, and the errorcorrection method of the resulting parsers. Before discussing these topics, we give a short overview of LLGEN specifications in the next section. Then, a section is devoted to each of the topics mentioned above, and finally, a section will discuss the cost of an LLGENgenerated parser.
Generalised LR parsing algorithms
, 2006
"... This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar is called a generalised (contextfree) parser. This thesis is devoted to the theoretical analysis of generalised parsing algorithms. We describe, analyse and compare several algorithms that are based on Knuth’s LR parser. This work underpins the design and implementation of the Parser Animation Tool (PAT). We use PAT to evaluate the asymptotic complexity of generalised parsing algorithms and to develop the Binary Right Nulled Generalised LR algorithm – a new cubic worst case parser. We also compare the Right Nullable Generalised LR, Reduction Incorporated Generalised LR, Farshi, Tomita and Earley algorithms using the statistical data collected by PAT. Our study indicates that the overheads associated with some of the parsing algorithms may have significant consequences on their behaviour.
Tree Transducers and Their Applications to XML
"... The present document contains notes on a course held in Tarragona/Spain at the ..."
Abstract
 Add to MetaCart
The present document contains notes on a course held in Tarragona/Spain at the