Re: Parsing context dependent languages?

jjan@cs.rug.nl (Beeblebrox)
19 Jan 1996 09:44:49 -0500

          From comp.compilers
Related articles
Parsing context dependent languages? apardon@rc1.vub.ac.be (1996-01-18)
Re: Parsing context dependent languages? jjan@cs.rug.nl (1996-01-19)
| List of all articles for this month |
From: jjan@cs.rug.nl (Beeblebrox)
Newsgroups: comp.compilers
Date: 19 Jan 1996 09:44:49 -0500
Organization: Dept. of Computing Science, Groningen University
References: 96-01-044
Keywords: parse

apardon@rc1.vub.ac.be (Antoon Pardon) wrote:
< If one wanted to describe the tautologies as a language one could come
up with a rule that stated:


if "A" is a tautology then "A <=> A" is a tautology.


In this case it is important the two A in "A <=> A" generate the same
subexpression something that is impossible with contextfree
languages.


Use attribute grammars (/tools) to express the context sensitive part.
--
Jan Jongejan email: jjan@cs.rug.nl
Dept. Comp.Sci.,
Univ. of Groningen, 8-{)
Netherlands.
[How do you get an attribute grammar to do the backing up you need to parse
something like this? -John]




--

Post a followup to this message

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