LL(k) Parsing

Sippu, Seppo; Soisalon-Soininen, Eljas

doi:10.1007/978-3-662-08424-3_3

Cited by 14 publications

(29 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similarly, a i = first(t i+1 ) is well-defined by the additional assumption on tree congruences. The above construction is reminiscent of covering of LR(k) grammars by LR(1) grammars (Sippu and Soisalon-Soininen, 1990).…”

Section: Construction Of a L-cfg From An Oracle Automatonmentioning

confidence: 99%

Transition-based dependency parsing as latent-variable constituent parsing

Nederhof¹

2016

Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata

View full text Add to dashboard Cite

show abstract

Section: Construction Of a L-cfg From An Oracle Automatonmentioning

confidence: 99%

Transition-based dependency parsing as latent-variable constituent parsing

Nederhof¹

2016

Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata

View full text Add to dashboard Cite

show abstract

“…The automata .At, rt defined in the previous section are deterministic only for a subset of the CFGs, called the LR(0) grammars (Sippu and Soisalon-Soininen, 1990), and behave nondeterministically in the general case. When designing tabular methods that simulate nondeterministic computations of ~4LR, two main difficulties are encountered:…”

Section: Lr Automatamentioning

confidence: 99%

Efficient tabular LR parsing

Nederhof¹,

Satta²

1996

Proceedings of the 34th Annual Meeting on Association for Computational Linguistics -

View full text Add to dashboard Cite

We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar transformations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time, is significantly reduced.

show abstract

“…Predictive LR (PLR) parsing with k symbols of lookahead was introduced in [17] as an algorithm which yields efficient parsers for a subset of the LR(k) grammars [16] and a superset of the LC(k) grammars. How deterministic PLR parsing succeeds in handling a larger class of grammars (the PLR(k) grammars) than the LC(k) grammars can be explained by identifying PLR parsing 1In [17] a different definition of the LC(k) grammars may be found, which is not completely equivalent.…”

Section: Predictive Lr Parsingmentioning

confidence: 99%

An optimal tabular parsing algorithm

Nederhof

1994

Proceedings of the 32nd Annual Meeting on Association for Computational Linguistics -

View full text Add to dashboard Cite

In this paper we relate a number of parsing algorithms which have been developed in very di erent areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a parallel algorithm. We show that these algorithms are based on the same underlying ideas.By relating existing ideas, we hope to provide an opportunity to improve some algorithms based on features of others. A second purpose of this paper is to answer a question which has come up in the area of tabular parsing, namely how to obtain a parsing algorithm with the property that the table will contain as little entries as possible, but without the possibility that two entries represent the same subderivation.

show abstract

LL(k) Parsing

Cited by 14 publications

References 0 publications

Transition-based dependency parsing as latent-variable constituent parsing

Transition-based dependency parsing as latent-variable constituent parsing

Efficient tabular LR parsing

An optimal tabular parsing algorithm

Contact Info

Product

Resources

About