| Selathco 0.91 Documentation |
4. ParserThe Selathco built-in parser performs an analysis of the input and tries to match the longest registred text sequence (a sequence is an arbitrary string). If no sequence can be matched, the text is just copied to the output. The registration of a sequence assignes a sequence listener to it and causes calling of the listener each time this sequence is matched.
The sequence listeners can be added/removed dynamically. Recursive calls of the same sequence listener are prevented. See the Selathco API for more info. 4.1 The LaTeX grammarThe Selathco parser is more pedantic than LaTeX and requires all LaTeX commands to fit the grammar:
|