|Generalising regular expressions to stack machines & all machines firstname.lastname@example.org (2001-09-20)|
|Re: Generalising regular expressions to stack machines & all machines email@example.com (Joachim Durchholz) (2001-10-06)|
|From:||"Joachim Durchholz" <firstname.lastname@example.org>|
|Date:||6 Oct 2001 16:34:39 -0400|
|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
* 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?
Return to the
Search the comp.compilers archives again.