<<< CTTL_RULE() function adaptor | Table Of Contents | begin(R) positive lookahead assertion >>> |
Common Text Transformation Library http://cttl.sourceforge.net/
CTTL provides a set of adaptors for grammar expressions. Each adaptor
The resulting adaptor object can be used as a fully-featured lexer component, such as a sub-expression, or an expression operand.
The following grammar adaptors are available:
Positive lookahead assertion, begin(R), returns upper boundary of input tokens that match grammar R.
Node expression adaptor, node(R), represents logical boundary of a token.
Substring expression adaptor, edge(R), captures boundaries of input tokens that match grammar R.
Entity expression adaptor,
entity(R), is a non-empty match validator,
forcing the adapted expression R to fail on an
epsilon symbol
match.
Copyright © 1997-2009 Igor Kholodov mailto:cttl@users.sourceforge.net.
Permission to copy and distribute this document is granted provided this copyright notice appears in all copies. This document is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.
<<< CTTL_RULE() function adaptor | Table Of Contents | begin(R) positive lookahead assertion >>> |