On Bounded Right Context Languages and Grammars
Susan Lochrie Graham · SIAM Journal on Computing · 1974
It is shown using phrase-structure-preserving grammatical transformations that the family of $(1,1)$ bounded right context languages is the same as the family of context-free deterministic languages. The elimination of $\lambda $-rules and a reconciliation of our definition of bounded right context with Floyd’s are also discussed.