Results 141 to 150 of about 192,464 (184)
Some of the next articles are maybe not open access.
1997
Generalized LR parsing has become popular in the second half of the 1980s, after the publication of Tomita’s algorithm [Tomita, 1985]. The theoretical foundation of this approach is in fact much older and dates back to Lang [1974].
openaire +1 more source
Generalized LR parsing has become popular in the second half of the 1980s, after the publication of Tomita’s algorithm [Tomita, 1985]. The theoretical foundation of this approach is in fact much older and dates back to Lang [1974].
openaire +1 more source
LL parsing, LR parsing, complexity, and automata
ACM SIGCSE Bulletin, 2002It is well known that pushdown-stack automata find application within the syntactic analysis phase of compilation. Nonetheless, in most compiler design textbooks the relation between popular parsing algorithms and the theory of deterministic pushdown-stack automata remains implicit.
openaire +1 more source
Acta Informatica, 1983
The principal tools in LR theory, viz. item grammars and their corresponding automata, are adapted for use with affix grammars. The items (and automata states) are furnished with attributes that serve as pointers into the parsing stack and thus determine the inherited affixes needed in a reduction step.
openaire +1 more source
The principal tools in LR theory, viz. item grammars and their corresponding automata, are adapted for use with affix grammars. The items (and automata states) are furnished with attributes that serve as pointers into the parsing stack and thus determine the inherited affixes needed in a reduction step.
openaire +1 more source
Strict deterministic versus LR(0) parsing
Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73, 1973Recently strict deterministic grammars and languages have been introduced [9,10,11]. This family of languages is quite fundamental in the study of the mathematical properties of deterministic languages and in dealing with some classical families of grammars such as LR(k) and bounded right context grammars [7,8,14]. These grammars are closely related to
Matthew M. Geller, Michael A. Harrison
openaire +1 more source
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Theory of Computing Systems, 2017M. Barash, A. Okhotin
semanticscholar +2 more sources
LR Parsing for Boolean Grammars
2005The generalized LR parsing algorithm for context-free grammars, invented by Tomita in 1986, is extended for the case of Boolean grammars, which are a recently introduced generalization of context-free grammars with logical connectives added to the formalism of rules.
openaire +1 more source
1997
In this chapter we consider another approach to parsing, called an LR(1)-parsing algorithm, as well as some simplified versions of it. We start by describing a general scheme of left-to-right parsing (section 16.1). Then we consider a class of grammars for which this scheme can be implemented easily (LR(0)-grammars, section 16.2).
openaire +1 more source
In this chapter we consider another approach to parsing, called an LR(1)-parsing algorithm, as well as some simplified versions of it. We start by describing a general scheme of left-to-right parsing (section 16.1). Then we consider a class of grammars for which this scheme can be implemented easily (LR(0)-grammars, section 16.2).
openaire +1 more source
Generalized LR Parsing for Grammars with Contexts
Computer Science Symposium in Russia, 2015M. Barash, A. Okhotin
semanticscholar +1 more source
AIParsing: Anchor-Free Instance-Level Human Parsing
IEEE Transactions on Image Processing, 2022Sanyi Zhang, Xiaochun Cao, Guo-Jun Qi
exaly