Re: Generalising regular expressions to stack machines & all machines

"Joachim Durchholz" <joachim_d@gmx.de>
6 Oct 2001 16:34:39 -0400

          From comp.compilers
Related articles
Generalising regular expressions to stack machines & all machines whopkins@alpha2.csd.uwm.edu (2001-09-20)
Re: Generalising regular expressions to stack machines & all machines joachim_d@gmx.de (Joachim Durchholz) (2001-10-06)
| List of all articles for this month |
From: "Joachim Durchholz" <joachim_d@gmx.de>
Newsgroups: comp.compilers
Date: 6 Oct 2001 16:34:39 -0400
Organization: Compilers Central
References: 01-09-074
Keywords: theory
Posted-Date: 06 Oct 2001 16:34:38 EDT

I won't pretend that I followed everything in your article (you lost me
somewhere in the second half).


What I'd like to know is how the representation of parses look like in
your approach. Usefulness depends on (at least) the following two
factors:
* Can a program identify semantic units in the representation?
* If the program issues error messages: are the semantic units
identifiable for the user who reads the error message?


Regards,
Joachim

Post a followup to this message

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