Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

xtl_char_symbol Class Reference

#include <xtl_primary.h>

Inheritance diagram for xtl_char_symbol:

Inheritance graph
[legend]
Collaboration diagram for xtl_char_symbol:

Collaboration graph
[legend]
List of all members.

Detailed Description

Implements behavior of symbol() lexeme inside CTTL grammar expressions.

Definition at line 580 of file xtl_primary.h.

Public Member Functions

template<typename UniverseT>
size_t find (UniverseT &edge_)
 Implements grammar evaluation method for symbol search algorithm, starting at the upper boundary of the parseable universe.
template<typename UniverseT>
size_t bang_find (UniverseT &edge_)
 Implements grammar evaluation method for repeatable search algorithm, starting at the upper boundary of the parseable universe.
template<typename UniverseT>
size_t internal_match (UniverseT &edge_)
 Implements match grammar evaluation method.


Member Function Documentation

size_t bang_find UniverseT &  edge_  )  [inline]
 

Implements grammar evaluation method for repeatable search algorithm, starting at the upper boundary of the parseable universe.

UniverseT
Template parameter specifying type of the parseable universe. Can be either cttl::const_edge or cttl::edge.
Parameters:
edge_ reference to the parseable universe.
Postcondition:
If method succeeds, the universe, specified by the edge_ parameter, gets consumed accordingly to the size of the matched symbol.
Returns:
evaluation result: if method succeeds, it returns absolute offset corresponding to the upper boundary of the matched symbol. Otherwise, it returns UniverseT::string_T::npos, indicating that the evaluation method has failed.
Remarks:
CTTL lexeme delegates implementation of its bang_find() to xtl_primary<xtl_char_symbol>::match().

Reimplemented from xtl_primary< xtl_char_symbol >.

Definition at line 651 of file xtl_primary.h.

size_t find UniverseT &  edge_  )  [inline]
 

Implements grammar evaluation method for symbol search algorithm, starting at the upper boundary of the parseable universe.

UniverseT
Template parameter specifying type of the parseable universe. Can be either cttl::const_edge or cttl::edge.
Parameters:
edge_ reference to the parseable universe.
Postcondition:
If method succeeds, the universe, specified by the edge_ parameter, gets consumed accordingly to the size of the matched symbol.
Returns:
evaluation result: if method succeeds, it returns absolute offset corresponding to the upper boundary of the matched symbol. Otherwise, it returns UniverseT::string_T::npos, indicating that the evaluation method has failed.
Remarks:
This lexeme delegates implementation of its find() to xtl_primary<xtl_char_symbol>::match().

Reimplemented from xtl_primary< xtl_char_symbol >.

Definition at line 616 of file xtl_primary.h.

size_t internal_match UniverseT &  edge_  )  [inline]
 

Implements match grammar evaluation method.

UniverseT
Template parameter specifying type of the parseable universe. Can be either cttl::const_edge or cttl::edge.
Parameters:
edge_ reference to the parseable universe.
Postcondition:
If method succeeds, the universe, specified by the edge_ parameter, is consumed accordingly to the size of the matched symbol:
    // 1. The ending position of the matched symbol is set:
    edge_.first.offset( end_offset );

    // 2. Starting position of the matched symbol is returned:
    return begin_offset;
Returns:
evaluation result: if method succeeds, it returns absolute offset corresponding to the upper boundary of the matched symbol. Otherwise, it returns UniverseT::string_T::npos, indicating that the evaluation method has failed.

Definition at line 687 of file xtl_primary.h.


The documentation for this class was generated from the following file:
Generated on Thu Nov 2 17:45:54 2006 for Common Text Transformation Library by  doxygen 1.3.9.1