Abstract LR-Parsing

Formal Modeling: Actors, Open Systems, Biological Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-24933-4_6 ◽

2011 ◽

pp. 90-109 ◽

Author(s):

Kyung-Goo Doh ◽

Hyunha Kim ◽

David A. Schmidt

Keyword(s):

Download Full-text

Suffix languages in Lr parsing

International Journal of Computer Mathematics ◽

10.1080/00207169508804370 ◽

1995 ◽

Vol 55 (3-4) ◽

pp. 135-153 ◽

Author(s):

Benjamin R. Seyfarth ◽

Manuel E. Bermudez

Keyword(s):

Download Full-text

Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts

Theory of Computing Systems ◽

10.1007/s00224-016-9683-3 ◽

2016 ◽

Vol 61 (2) ◽

pp. 581-605 ◽

Author(s):

Mikhail Barash ◽

Alexander Okhotin

Keyword(s):

Parsing Algorithm

Download Full-text

Increasing the Applicability of LR Parsing

Text, Speech and Language Technology - Recent Advances in Parsing Technology ◽

10.1007/978-94-010-9733-8_3 ◽

1996 ◽

pp. 35-57 ◽

Author(s):

Mark-Jan Nederhof ◽

Janos J. Sarbo

Keyword(s):

Download Full-text

LR Parsing for Boolean Grammars

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/11505877_32 ◽

2005 ◽

pp. 362-373 ◽

Author(s):

Alexander Okhotin

Keyword(s):

Boolean Grammars

Download Full-text

LR-parsing of extended context free grammars

Acta Informatica ◽

10.1007/bf00265221 ◽

1976 ◽

Vol 7 (1) ◽

pp. 61-73 ◽

Author(s):

O. L. Madsen ◽

B. B. Kristensen

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

Software visualization of LR parsing and synthesized attribute evaluation

Software Practice and Experience ◽

10.1002/(sici)1097-024x(199901)29:1<1::aid-spe216>3.0.co;2-n ◽

1999 ◽

Vol 29 (1) ◽

pp. 1-16 ◽

Author(s):

Elizabeth L. White ◽

Jeffrey Ruby ◽

Laura Denise Deddens

Keyword(s):

Software Visualization ◽

Attribute Evaluation

Download Full-text

A shift-first strategy for interleaved LR parsing

Information Sciences ◽

10.1016/0020-0255(94)00069-n ◽

1995 ◽

Vol 84 (1-2) ◽

pp. 1-13 ◽

Author(s):

Yong-Seok Lee ◽

Jun-Ichi Aoe ◽

Hideto Tomabechi

Keyword(s):

Download Full-text

Large-vocabulary spoken word recognition using time-delay neural network phoneme spotting and predictive lr-parsing

Systems and Computers in Japan ◽

10.1002/scj.4690220111 ◽

1991 ◽

Vol 22 (1) ◽

pp. 99-108 ◽

Author(s):

Yasuhiro Minami ◽

Hidefumi Sawai ◽

Masanori Miyatake

Keyword(s):

Neural Network ◽

Word Recognition ◽

Spoken Word Recognition ◽

Spoken Word ◽

Large Vocabulary ◽

Download Full-text

Parsing Partially Ordered Multisets

International Journal of Foundations of Computer Science ◽

10.1142/s0129054197000240 ◽

1997 ◽

Vol 08 (04) ◽

pp. 379-407 ◽

Author(s):

Twan Basten

Keyword(s):

Partial Order ◽

Distributed Computation ◽

Total Order ◽

Language Theory ◽

Basic Algorithm ◽

Sequential Computation ◽

Partially Ordered ◽

A partially ordered multiset or pomset is a generalization of a string in which the total order has been relaxed to a partial order. Strings are often used as a model for sequential computation; pomsets are a natural model for parallel and distributed computation. By viewing pomsets as a generalization of strings, the question is raised whether concepts from language theory can be generalized to pomsets. An important area in the theory of languages is parsing theory. This paper develops the fundamentals of a parsing theory for pomsets, called PLR parsing. It is based on the LR-parsing technique, which is the most powerful deterministic parsing technique in language theory. The basic algorithm in the class of PLR parsing algorithms, the PLR(0) algorithm is explained in detail.

Download Full-text

Component-based LR parsing

Computer Languages Systems & Structures ◽

10.1016/j.cl.2009.01.002 ◽

2010 ◽

Vol 36 (1) ◽

pp. 16-33 ◽

Author(s):

Xiaoqing Wu ◽

Barrett R. Bryant ◽

Jeff Gray ◽

Marjan Mernik

Keyword(s):

Download Full-text