Christophe Rhodes csr21@cantab.net writes:
Sorry, I meant that there would be no parse for the buffer beyond a sequence of tokens.
Oh yeah, this should be trivial. A parse tree of some sort is always necessary for redisplay and other things, hence my question.
(Annoyingly, I realised after I posted that some of the mini languages that I have a need to support include elements that are not regular: the common case is properly-nesting balanced comments. I don't know the capabilities of cl-automaton; can it represent such things?)
I'm pretty sure cl-automaton as it stands only implements regular expressions. I do not know whether it can reasonably be extended or not, but for simplish things like balancing, I'd wager it can.