Results 121 to 130 of about 192,464 (184)
Some of the next articles are maybe not open access.
ACM SIGPLAN Notices, 1986
LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser. A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an ...
T. Pennello
semanticscholar +2 more sources
LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser. A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an ...
T. Pennello
semanticscholar +2 more sources
Incorporating LR parsing into SPHINX
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991The integration of an LR natural language parser with the SPHINX speech recognition system is described. LR parsing was incorporated into SPHINX to provide more global grammatical constraints. However, when using a tight grammar in a left-to-right continuous speech recognizer, when one word is missing or wrong, often several subsequent words are also ...
K. Kita, W. Ward
semanticscholar +2 more sources
LR Parsing for Conjunctive Grammars
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Okhotin
semanticscholar +2 more sources
Even faster generalized LR parsing
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Aycock +3 more
semanticscholar +3 more sources
Generalized Lr Parsing Algorithm for Boolean Grammars
International Journal of Foundations of Computer Science, 2006The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which ...
A. Okhotin
semanticscholar +3 more sources
The Generalized LR Parsing Algorithm
, 1991LR parsing is a widely used method of syntax analysis for a variety of reasons. First and foremost, an LR parser is a deterministic parser which is highly efficient: it scans the input string in one pass and is able to detect errors at an early stage.
M. Tomita, See-Kiong Ng
semanticscholar +2 more sources
A text-based syntax completion method using LR parsing
PEPM@POPL, 2021This paper presents a text-based syntax completion method using an LR parser. We propose formal definitions of candidate text to be completed based on the sentential forms, and we design algorithms for computing candidates through reductions in the LR ...
Isao Sasano, Kwanghoon Choi
semanticscholar +1 more source
Parallel Implementation of Predicting RNA using LR Parsing in MPI
2019 International Symposium on Recent Advances in Electrical Engineering (RAEE), 2019RNA secondary structure prediction is a core task to find out the relationship between it’s structure and function. Methods based on grammars, dynamic programming, matching and evolutionary algorithms have been developed for modeling and analysis of RNA ...
A. Khan
semanticscholar +1 more source
Ranked Syntax Completion With LR Parsing
ACM Symposium on Applied ComputingThis paper introduces a novel text-based syntax completion method that generates a sorted list of syntactic structure candidates for program writing. To date, no existing methods for syntax structure completion have offered candidates with accompanying ...
Kwanghoon Choi +3 more
semanticscholar +1 more source
Computer Languages, Systems & Structures, 2010
A language implementation with proper compositionality enables a compiler developer to divide-and-conquer the complexity of building a large language by constructing a set of smaller languages. Ideally, these small language implementations should be independent of each other such that they can be designed, implemented and debugged individually, and ...
Xiaoqing Wu +3 more
openaire +1 more source
A language implementation with proper compositionality enables a compiler developer to divide-and-conquer the complexity of building a large language by constructing a set of smaller languages. Ideally, these small language implementations should be independent of each other such that they can be designed, implemented and debugged individually, and ...
Xiaoqing Wu +3 more
openaire +1 more source