What would be the easiest way of accomplishing this, assuming I'm already able to use gppg for syntax analysis?
I don't know how to check which non-terminating symbols a parser had to go through in order to set the token in its rightful place (or, failing that, report an error).
Any help would be greatly appreciated!