Language functionality, programming and otherwise.
More...
Language functionality, programming and otherwise.
Supported
- jau::lang::token_fsm A lexical analyzer (tokenizer) using a tabular finite-state-machine (FSM), aka
endlicher automat (EA)
For serious applications w/ regular expressions and more, as well as a lex C++ alternative to flex, consider using Re-flex.
◆ code_point_t
Unsigned int symbol for alphabet code-point type.
Definition at line 79 of file token_fsm.hpp.
◆ code_point_func
| typedef code_point_t(* jau::lang::alphabet::code_point_func) (const char c) noexcept |
|
noexcept |
◆ alphabet()
◆ name()
| constexpr const std::string & jau::lang::alphabet::name |
( |
| ) |
const |
|
inlineconstexprnoexcept |
Human readable name for this alphabet instance.
Definition at line 98 of file token_fsm.hpp.
◆ base()
The fixed base used for this alphabet, i.e.
number of token.
Definition at line 101 of file token_fsm.hpp.
◆ code_point()
| constexpr code_point_t jau::lang::alphabet::code_point |
( |
const char |
c | ) |
const |
|
inlineconstexprnoexcept |
Returns the token of the given character or code_error if not element of this alphabet.
Definition at line 104 of file token_fsm.hpp.
◆ to_string() [1/2]
| std::string jau::lang::alphabet::to_string |
( |
| ) |
const |
|
inlinenoexcept |
◆ to_string() [2/2]
| std::string jau::lang::to_string |
( |
const alphabet & |
v | ) |
|
|
inlinenoexcept |
◆ operator!=()
◆ operator==()
◆ ascii95_alphabet()
| jau::lang::ascii95_alphabet::ascii95_alphabet |
( |
| ) |
|
|
inlinenoexcept |
◆ ascii69_alphabet()
| jau::lang::ascii69_alphabet::ascii69_alphabet |
( |
| ) |
|
|
inlinenoexcept |
◆ ascii26_alphabet()
| jau::lang::ascii26_alphabet::ascii26_alphabet |
( |
| ) |
|
|
inlinenoexcept |
◆ code_error
token_error value, denoting an invalid alphabet code-point.
Definition at line 84 of file token_fsm.hpp.