6

Deterministic context-free languages are commonly defined using an automaton concept, the (restricted, deterministic) pushdown automaton. To some that is confusing, as the name context-free refers to a grammar type.

I seem to remember there exists a characterization of the DCF languages using grammars. In my recollection it used a complicated equivalence on non-terminals. Can anyone provide a pointer to that work?

Raphael
  • 73,212
  • 30
  • 182
  • 400
Hendrik Jan
  • 31,459
  • 1
  • 54
  • 109

2 Answers2

4

Wikipedia actually gives you the model and points to [1] for reference: LR grammars are equivalent to DPDA.

  1. On the Translation of Languages from Left to Right by Donald Knuth (1965) [free download]
Raphael
  • 73,212
  • 30
  • 182
  • 400
1

Just an additional note of possible use: the PLL(0) grammars == the strict deterministic grammars, perhaps an easier approach for both understanding and practical application. A nice description is in Parsing Techniques, 2nd Edition, pp354-357.

Ron Burk
  • 111
  • 2