Shift-reduce parser

Known as: Shift reduce parser, Shift reduce parsing, Shift-reduce parsing

A shift-reduce parser is a class of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

We establish the following specific relation between contextfree grammars that have LL(k) and LR(k) parsers, respectively: after…

Highly Cited

2011

Highly Cited

2011

CCGs are directly compatible with binary-branching bottom-up parsing algorithms, in particular CKY and shift-reduce algorithms…

2006

In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a…

2006

This paper presents a discriminative parser that does not use a generative model in any way, yet whose accuracy still surpasses a…

2004

In this paper, we present a probabilistic shift-reduce parsing model which can overcome low context-sensitivity of previous LR…

2001

Recent contributions to statistical language modeling for speech recognition have shown that probabilistically parsing a partial…

1998

Simple Recurrent Networks (Srns) have been widely used in natural language processing tasks. However, their ability to handle…

1994

The design of an LR parser based on interleaving the atomic symbol processing of a context-free backbone grammar with the full…

1984

It is argued that syntactic preference principles such as Right Association and Minimal Attachment are unsatisfactory as usually…

1983

A method is described to augment an ordinary shift-reduce parser into an incremental one. To parse a modified input, the…