| [imp-dev] Next token possibilties |
I think I've tried to ask this question of Stan before, but I'm going to try again here …
In the language that I am developing with IMP/LPG, there is, as in Java, the concept of a statement and a delimiter that indicates the end of a statement. Given a partially specified statement with some set of tokens {t1, t2, t3} for example, all of the information is present in the language definition to be able to answer the question "What are the set of tokens that are legal next tokens in a legal statement at the end of this incomplete string of tokens?" The answer to this question would be ever so useful in terms of providing completion help to the user. Is there some way to ask this question of the generated parser?
Any help in moving in this direction would be greatly appreciated!
Andy
Andrew Crapo
Information Scientist
GE Global Research
T +1 518 387 5729
F +1 518 387 6104
D *833 5729
E crapo@xxxxxxxxxxxxxxx
www.research.ge.com
One Research Circle
Niskayuna, NY 12309 USA
General Electric Company
GE imagination at work