How can be done recursive parsing with CL-PPCRE? For example infix arithmetic expressions with parentheses..
On Fri, 18 Nov 2005 17:26:26 +1000, Igor Plekhov penguin@ocean.vvo.ru wrote:
How can be done recursive parsing with CL-PPCRE? For example infix arithmetic expressions with parentheses..
Depends on your specific problem. Generally, recursive parsing can't be done with regular expressions alone - check out text books like the "Dragon Book" for a mathematical proof.
http://catb.org/~esr/jargon/html/D/Dragon-Book.html
For approaches how regular expressions (and CL-PPCRE in particular) can help when building parsers see the mailing list archives and again consult a good CS text book.
Cheers, Edi.
cl-ppcre-devel@common-lisp.net