Abstract
A clear proof of the statement that every deterministic language has an LR(l) grammar is given. It uses a definition of LR(k) grammars found in Lewis and Stearns and the Ginsburg's simulation of a pda by a contex-free grammar.
| Original language | English |
|---|---|
| Pages (from-to) | 526-530 |
| Number of pages | 5 |
| Journal | Israel Journal of Mathematics |
| Volume | 10 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1971 |