Parsing stack-based languages

Olivier Lefevre <>
26 Oct 1997 22:11:13 -0500

          From comp.compilers

Related articles
Postscript Parser (1997-10-17)
Re: Postscript Parser (1997-10-19)
Parsing stack-based languages (Olivier Lefevre) (1997-10-26)
Re: Parsing stack-based languages (1997-10-29)
| List of all articles for this month |

From: Olivier Lefevre <>
Newsgroups: comp.compilers
Date: 26 Oct 1997 22:11:13 -0500
Organization: UBS Securities Inc., TFRT Dept.
References: 97-10-091 97-10-096
Keywords: parse, comment

Aandi Inston wrote:

> PostScript isn't a language that can be parsed by a grammar. It's a
> full programming language, but it's stack based (no structure) and
> interpreted so the running program can change the meaning.

That is interesting. What, then, is the theory (if any) underlying
the parsers of such languages (Forth being another)?


-- O.L.
[The parser does very little, and most of the semantics are determined
dynamically as the program runs. -John]

Post a followup to this message

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