From: Darren Cook (darren_at_[hidden])
Date: 2003-11-17 22:47:06
> - Ever try to write a regular expression to match balanced, nested tags?
Yes, it is horrible.
> Since ET's are native code, they can refer to other ET's (and
> themselves!) in a natural way, so you can build recursive parsers out of
Can you show an example of how this would work? How is this different from
> In short, expression templates make regular expressions first-class
> citizens of C++.
Most regexes I've written have been constant at compile-time, and if you get
compile-time checking then this will be good.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk