CFL < ? < CSL (Amr Sabry)
Tue, 25 Jun 91 19:42:50 GMT

          From comp.compilers

Related articles
CFL < ? < CSL (1991-06-25)
Re: CFL < ? < CSL oak! (1991-07-04)
| List of all articles for this month |

Newsgroups: comp.theory,comp.compilers
From: (Amr Sabry)
Followup-To: comp.theory
Keywords: parse, lex, design
Organization: Rice University, Houston, Texas
Date: Tue, 25 Jun 91 19:42:50 GMT

The syntax of programming languages is usullay descibed by context-free
languages decorated with some context-sensitive restrictions (scoping -
types ...)

My question is whether there exists a class of languages lying properly
between context-free languages and context-sensitive languages and that is
"efficiently" recognizable.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.