Chapter 1 REGULAR APPROXIMATION OF CFLS : A GRAMMATICAL VIEW

We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.

[1]  Stephen Pulman,et al.  Grammars, parsers, and memory limitations , 1986 .

[2]  Seppo Sippu,et al.  Parsing Theory , 1990, EATCS.

[3]  STEVEN KRAUWER,et al.  TRANSDUCERS AND GRAMMARS AS THEORIES OF LANGUAGE , 1981 .

[4]  Revised February.  Extended finite state models of language , 1997 .

[5]  Edmund Grimley Evans.  Approximating context-free grammars with a finite-state calculus , 1997 .

[6]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[7]  R. E. Sm.  A Regularity Test for Pushdown Machines , 2004 .

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[9]  Noam Chomsky,et al.  A Note on Phrase Structure Grammars , 1959, Inf. Control..

[10]  Mark-Jan Nederhof,et al.  An Optimal Tabular Parsing Algorithm , 1994, ACL.

[11]  Mehryar Mohri,et al.  Dynamic compilation of weighted context-free grammars , 1998, COLING.

[12]  Joseph S. Ullian,et al.  Partial Algorithm Problems for Context Free Languages , 1967, Inf. Control..

[13]  Kenneth Ward Church,et al.  Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table , 1982, CL.

[14]  Mark-Jan Nederhof,et al.  Practical Experiments with Regular Approximation of Context-Free Languages , 1999, CL.

[15]  Jacky Herz,et al.  Local Syntactic Constraints , 1991, IWPT.

[16]  Mark-Jan Nederhof,et al.  Context-Free Parsing through Regular Approximation , 1998 .

[17]  Mori Rimon.  The Recognition Capacity Of Local Syntactic Constraints , 1991, EACL.

[18]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[19]  Karl M. Schimpf,et al.  Practical Arbitrary Lookahead LR Parsing , 1990, J. Comput. Syst. Sci..

[20]  Giorgio Satta,et al.  Efficient Tabular LR Parsing , 1996, ACL.

[21]  Mark Johnson,et al.  Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms , 1998, ACL.

[22]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[23]  Theodore P. Baker,et al.  Extending Lookahead for LR Parsers , 1981, J. Comput. Syst. Sci..

[24]  D. Terence Langendoen,et al.  Finite-State Parsing of Phrase-Structure Languages and the Status of Readjustment Rules in Grammar , 2010 .

[25]  D. Terence Langendoen,et al.  On the Design of Finite Transducers for Parsing Phrase-Structure Languages , 1987 .

[26]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[27]  Daniel J. Rosenkrantz,et al.  Deterministic Left Corner Parsing (Extended Abstract) , 1970, SWAT.

[28]  Mark-Jan Nederhof,et al.  Linguistic parsing and program transformations , 1994 .

[29]  Andreas Stolcke,et al.  Precise N-Gram Probabilities From Stochastic Context-Free Grammars , 1994, ACL.

[30]  Yves Schabes,et al.  Finite-State Approximation of Phrase-Structure Grammars , 1997 .