How to Cover a Grammar

15 years 3 months ago

Download www.aclweb.org

A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-deterministlc LRoparsers for RTN grammars.

René Leermakers

Real-time Traffic

ACL 1989 | ACL 2007 | Earley-like Parsers | Non-deterministic Pushdown Automata | RTN Grammars |

claim paper

» The Polytope of ContextFree Grammar Constraints

» Extracting Synchronous Grammar Rules From WordLevel Alignments in Linear Time

» PerGram A TRALE Implementation of an HPSG Fragment of Persian

» Implementing Controlled Languages in GF

» On the Relation Between Primitive Recursion Schematization and Divergence

» Detecting and Parsing Architecture at City Scale from Range Data

» Deriving tolerant grammars from a baseline grammar

» GF Parallel Resource Grammars and Russian

Post Info
More Details (n/a)

Added	06 Nov 2010
Updated	06 Nov 2010
Type	Conference
Year	1989
Where	ACL
Authors	René Leermakers

Comments (0)

Sciweavers

How to Cover a Grammar

ACL 1989 | ACL 2007 | Earley-like Parsers | Non-deterministic Pushdown Automata | RTN Grammars |

Explore & Download

Productivity Tools

Sciweavers