Filters








2,308 Hits in 2.1 sec

Construction of efficient generalized LR parsers [chapter]

Miguel A. Alonso, David Cabrero, Manuel Vilares
1998 Lecture Notes in Computer Science  
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm.  ...  The result is a Generalized LR parsing algorithm working at complexity O(n 3 ) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the  ...  Earley parsing An Earley parser [3] for a grammar G and input a 1 . . . a n constructs a sequence of n + 1 set of items.  ... 
doi:10.1007/bfb0031377 fatcat:krqndrly6jccxmatckhi6hzmei

A Drop-in Replacement for LR(1) Table-Driven Parsing

Michael Oudshoorn
2021 Advances in Computing and Engineering  
This paper presents a construction method for a deterministic one-symbol lookahead LR parser which allows non-terminals in the parser look-ahead.  ...  This is achieved by replacing the deterministic push down automata of LR parsing by a two-stack automata. The class of grammars accepted by the two-stack parser properly contains the LR(k) grammars.  ...  A parser construction method for the two-stack machine which produces efficient, deterministic parsers for a broad class of grammars properly including LR(k) grammars is presented.  ... 
doi:10.21622/ace.2021.01.2.047 fatcat:md53ji3xlzauvgvos4pkfez2xa

Page 25 of Computational Linguistics Vol. 19, Issue 1 [page]

1993 Computational Linguistics  
We compare the performance of an optimized variant of Tomita’s (1987) generalized LR parsing algorithm to an (efficiently indexed and optimized) chart parser.  ...  construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on LR parsing techniques.  ... 

Page 192 of Computational Linguistics Vol. 21, Issue 2 [page]

1995 Computational Linguistics  
can be built using various amounts of lookahead to make the operation of the parser (more) deterministic, and hence more efficient.  ...  An Earley parser constructs sets of possible items on the fly, by following all possible partial derivations.  ... 

Incremental generation of parsers

J. Heering, P. Klint, J. Rekers
1989 SIGPLAN notices  
An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers.  ...  We motivate the need for these techniques in the context of interactive language definition environments, present all required algorithms, and give measurements comparing their performance with that of  ...  We opted for a more efficient LR(0) table generation phase at the expense of some loss in parsing efficiency for non-LR(0) languages (but without restricting the class of acceptable grammars in any way  ... 
doi:10.1145/74818.74834 fatcat:xgjbzodzcbfjtdomsz7bytvja4

Directly-Executable Earley Parsing [chapter]

John Aycock, Nigel Horspool
2001 Lecture Notes in Computer Science  
Deterministic parsing techniques are typically used in favor of general parsing algorithms for efficiency reasons.  ...  We describe how to narrow the performance gap between general and deterministic parsers, constructing a directlyexecutable Earley parser that can reach speeds comparable to deterministic methods even on  ...  This work was supported in part by a grant from the National Science and Engineering Research Council of Canada. Shannon Jaeger made a number of helpful comments on a draft of this paper.  ... 
doi:10.1007/3-540-45306-7_16 fatcat:je7tedp6qrh7ffhtfxm3cvem6y

Polynomial time and space shift-reduce parsing of arbitrary context-free grammars

Yves Schabes
1991 Proceedings of the 29th annual meeting on Association for Computational Linguistics -  
The performance of the resulting parser is formally proven to be superior to Earley's parser (1970).  ...  Finally, we explain how other more efficient variants of the basic parser can be obtained by determinizing portionsof the basic non-deterministic pushdown machine while still using the same pseudoparallel  ...  Earley himself ([1968] pages 69-89) proposed to precompile the state sets generated by his algorithm to make it as efficient as LR(k) parsers (Knuth, 1965) when used on LR(k) grammars by precomputing  ... 
doi:10.3115/981344.981358 dblp:conf/acl/Schabes91 fatcat:aiviavudaje5zne4or5fd6vpnu

Whale Calf, a Parser Generator for Conjunctive Grammars [chapter]

Alexander Okhotin
2003 Lecture Notes in Computer Science  
A parser generator is a program that, given a grammar for some language, constructs a syntactical analyzer for that language.  ...  Whale Calf is a parser generator that supports the conjunctive grammars, introduced in [2, 3, 4], as the means of specifying the language.  ...  The most important case of k = 1 is implemented separately in order to achieve better efficiency. iii. &LR [7] .  ... 
doi:10.1007/3-540-44977-9_20 fatcat:2s37fkhs4nahrdsz5y7fmatyzi

Incremental generation of parsers

J. Heering, P. Klint, J. Rekers
1989 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation - PLDI '89  
. • The efficiency of the parsing process itself remains unaffected, in the sense that once all needed parts of the parser have been generated, the parser will be as efficient as a conventionally generated  ...  [ASU86, eh. 4.4] A recursive descent parser generator constructs a parsing program, whereas an LL generator constructs a parse table that is interpreted by a fixed parser.  ...  We opted for a more efficient LR(O) table generation phase at the expense of some loss in parsing efficiency for non-LR(O) languages (but without restricting the class of acceptable grammars in any way  ... 
doi:10.1145/73141.74834 dblp:conf/pldi/HeeringKR89 fatcat:l34b3uvqofbepcrgmr64jdtys4

Page 289 of Mathematical Reviews Vol. , Issue 81A [page]

1981 Mathematical Reviews  
This general approach establishes a mathematical treatment of LR(k) parsing which does not rely on the actual construction of an LR(k) parser.  ...  However, if the elimination process is performed during the construction of an SLR parser, then the resulting parser may be invalid even if it were free of conflicts.” 81a:68091 Prabhala, Bhaskaram; Sethi  ... 

The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms

Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
2004 Electronical Notes in Theoretical Computer Science  
We illustrate the use of the toolset in the construction of a comparative study of three variants of the Tomita-style GLR parsing algorithm running on LR(0), SLR(1) and LR(1) tables for ANSI-C, ISO-Pascal  ...  and IBM VS-COBOL, and give results showing the size of the structures constructed by these parsers and the amount of searching required during the parse, which abstracts their runtime.  ...  As a trivial example consider the expansion of Kleene closure to BNF. Left recursive rules are handled efficiently by LR parsers but right recursive rules generate extra stack activity.  ... 
doi:10.1016/j.entcs.2004.06.008 fatcat:q4seiunzfvfkja5z5r77cnquvq

Generalised recursive descent parsing and follow-determinism [chapter]

Adrian Johnstone, Elizabeth Scott
1998 Lecture Notes in Computer Science  
Modifications of the basic algorithm to improve efficiency lead to a discussion of/ollow-deterrainisra, a fundamental property that gives insights into the behavioux of both LL and LR parsers.  ...  This paper presents a construct for mapping arbitrary nonleft recursive context-free grammars into recursive descent parsers that: handle ambiguous granunars correctly; perform with LL(1 ) efficiency on  ...  Our parser generator produces efficient parsers if the designer can refine their g r a m m a r so that it has suitable properties.  ... 
doi:10.1007/bfb0026420 fatcat:t6gslpihgrf3ji6mdxrwouyq54

LR recursive transition networks for Earley and Tomita parsing

Mark Perlin
1991 Proceedings of the 29th annual meeting on Association for Computational Linguistics -  
The LR-RTNs, however, are efficient, and shall be used to construct" (1) a nondeterministic parser, (2) a basic LR(0) parser, (3) Earley's algorithm (and the chart parsers), and (4) incremental and compiled  ...  . • Tomita has proposed (Tomita, 1985) constructing his algorithm from Earley's parser, instead of DeRemer's LR parser.  ... 
doi:10.3115/981344.981357 dblp:conf/acl/Perlin91 fatcat:du3jw2dv2jg4vipac66sweah3a

Evaluating GLR parsing algorithms

Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
2006 Science of Computer Programming  
We give results showing the size of the structures constructed by these parsers and the amount of searching required during the parse, which abstracts their runtime.  ...  We describe the behaviour of three variants of GLR parsing: (i) Farshi's original correction to Tomita's non-general algorithm; (ii) the Right Nulled GLR algorithm which provides a more efficient generalisation  ...  As a trivial example consider the expansion of Kleene closure to BNF. Left recursive rules are handled efficiently by LR parsers but right recursive rules generate extra stack activity.  ... 
doi:10.1016/j.scico.2006.04.004 fatcat:eiqtzniwmvaahnnefzsajteb24

GLR Parser with Conditional Action Model(CAM)

Yong-Jae Kwak, Young-Sook Hwang, Hoo-Jung Chung, So-Young Park, Sang-Zoo Lee, Hae-Chang Rim
2001 Natural Language Processing Pacific Rim Symposium  
The parser takes probabilistic shift or reduce action on the graph-structured stack, which is conditioned on the partially constructed parse.  ...  In this paper, we propose a new probabilistic GLR parsing method that can solve the problems of conventional LR parsing approaches.  ...  Introduction LR(Left-to-right scan, Rightmost derivation) parsing is regarded as one of the most efficient parsing methods, because it doesn't require any extra overheads to find the previously constructed  ... 
dblp:conf/nlprs/KwakHCPLR01 fatcat:5yfdfj5p5vgfjpq2hm46lyk26e
« Previous Showing results 1 — 15 out of 2,308 results