Results 1  10
of
40
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 702 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical contextfree programming language grammars. In an empirical comparison it appears to be superior to the topdown and bottomup algorithms studied by Griffiths and Petrlck.
The Syntax Definition Formalism SDF  Reference Manual
, 2001
"... SDF is a formalism for the definition of syntax which is comparable to BNF in some respect, but has a wider scope in that it also covers the definition... ..."
Abstract

Cited by 149 (24 self)
 Add to MetaCart
SDF is a formalism for the definition of syntax which is comparable to BNF in some respect, but has a wider scope in that it also covers the definition...
Statistical syntaxdirected translation with extended domain of locality
 In Proc. AMTA 2006
, 2006
"... A syntaxdirected translator first parses the sourcelanguage input into a parsetree, and then recursively converts the tree into a string in the targetlanguage. We model this conversion by an extended treetostring transducer that have multilevel trees on the sourceside, which gives our system m ..."
Abstract

Cited by 93 (14 self)
 Add to MetaCart
A syntaxdirected translator first parses the sourcelanguage input into a parsetree, and then recursively converts the tree into a string in the targetlanguage. We model this conversion by an extended treetostring transducer that have multilevel trees on the sourceside, which gives our system more expressive power and flexibility. We also define a direct probability model and use a lineartime dynamic programming algorithm to search for the best derivation. The model is then extended to the general loglinear framework in order to rescore with other features like ngram language models. We devise a simpleyeteffective algorithm to generate nonduplicate kbest translations for ngram rescoring. Initial experimental results on EnglishtoChinese translation are presented. 1
Nondeterministic algorithms
, 1967
"... ABSTRACT. Programs to solve combinatorial search problems may often be simply written by using multiplevalued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs. The process is ill ..."
Abstract

Cited by 67 (2 self)
 Add to MetaCart
ABSTRACT. Programs to solve combinatorial search problems may often be simply written by using multiplevalued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs. The process is illustrated with algorithms to find all solutions to the eight queens problem on the chessboard, and to find all simple cycles in a network. Two roads diverged in a yellow wood, And sorry I could not travel both And be one traveler, long I stood And looked down one as far as I could To where it beat in the undergrowth....Robert Frost All the time life is a fork. If you are straight up with yourself you don't have to decide which road to take. Your karma will look after that.George Harrison Nondeterministic algorithms are conceptual devices to simplify the design of backtracking algorithms [3] by allowing considerations of program bookkeeping required
A comparison of pebble tree transducers with macro tree transducers
 Acta Informatica
, 2003
"... Abstract. The npebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation τ of an npebble tree transducer can be realized by a composition of n + 1 0pebble tree transducers. Next, the pebble t ..."
Abstract

Cited by 37 (10 self)
 Add to MetaCart
Abstract. The npebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation τ of an npebble tree transducer can be realized by a composition of n + 1 0pebble tree transducers. Next, the pebble tree transducer is compared with the macro tree transducer, a wellknown model for syntaxdirected semantics, with decidable type checking. The 0pebble tree transducer can be simulated by the macro tree transducer, which, by the first result, implies that (2) τ can be realized by an (n+1)fold composition of macro tree transducers. Conversely, every macro tree transducer can be simulated by a composition of 0pebble tree transducers. Together these simulations prove that (3) the composition closure of npebble tree transducers equals that of macro tree transducers (and that of 0pebble tree transducers). Similar results hold in the nondeterministic case. Finally, (4) the output languages of deterministic npebble tree transducers form a hierarchy with respect to the number n of pebbles. 1
An errorcorrecting parse algorithm
 Communications of the ACM
, 1963
"... During the past few years, research into socalled ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
During the past few years, research into socalled
Macro Tree Translations of Linear Size Increase are MSO Definable
 SIAM J. Comput
, 2001
"... Abstract. The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation is MSO definable (i.e., definable in monadic secondorder logic). This gives a ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Abstract. The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation is MSO definable (i.e., definable in monadic secondorder logic). This gives a new characterization of the MSO definable tree translations in terms of macro tree transducers: they are exactly the macro tree translations of linear size increase. The second main result is that given a macro tree transducer, it can be decided whether or not its translation is MSO definable, and if it is then an equivalent MSO transducer can be constructed. Similar results hold for attribute grammars, which define a subclass of the macro tree translations.
Recursive Adaptable Grammars
 Master’s Thesis, Worchester Polytechnic Institute
, 1998
"... ContextFree Grammars (CFGs) are a simple and intuitively appealing formalism for the description of programming languages, but lack the computational power to describe many common language features. Over the past three decades, numerous extensions of the CFG model have been developed. Most of these ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
ContextFree Grammars (CFGs) are a simple and intuitively appealing formalism for the description of programming languages, but lack the computational power to describe many common language features. Over the past three decades, numerous extensions of the CFG model have been developed. Most of these extensions retain a CFG kernel, and augment it with a distinct facility with greater computational power. However, in all the most powerful CFG extensions, the clarity of the CFG kernel is undermined by the opacity of the more powerful extending facility. An intuitively appealing strategy for CFG extension is grammar adaptability, the principle that declarations in a program effectively modify the contextfree grammar of the programming language. An adaptable grammar is equipped with some formal means for modifying its own CFG kernel. Most previous adaptable grammar formalisms have, unfortunately, failed to realize the potential clarity of this concept. In this thesis, a representative samp...
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 t ..."
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.