Print

Print


Mike Taylor wrote:

> Well, yeah. It is true that people who have never learned how to
>
>implement recursive-descent parsers from BNF grammars are going to
>struggle to implement a recursive-descent CQL parser from its BNF
>grammar.  That is not a property of the CQL grammar, though, which is
>about as straightforward as a non-toy grammar gets.
>  
>
 This sort of negates any claim that "SRU is simple", though, doesn't it?

Just sayin',
-Ross.