index c1d9043f7d6a438f6c156bf22a94b6fedbf4bfc5..c835e87215e8f42e0b27eceb518aafd8e024329e 100644 (file)
<para>
The parser has to check the query string (which arrives as plain
- ASCII text) for valid syntax. If the syntax is correct a
+ text) for valid syntax. If the syntax is correct a
<firstterm>parse tree</firstterm> is built up and handed back;
otherwise an error is returned. The parser and lexer are
implemented using the well-known Unix tools <application>bison</>