Language functionality, programming and otherwise. More...

Classes
class	jau::lang::alphabet
	Base Alphabet Specification providing the alphabet for token_fsm. More...

class	jau::lang::ascii26_alphabet
	Case insensitive ASCII base 26 alphabet with ASCII code-point sorting order. More...

class	jau::lang::ascii69_alphabet
	Case insensitive ASCII base 69 alphabet with ASCII code-point sorting order. More...

class	jau::lang::ascii95_alphabet
	Full ASCII base 95 alphabet with ASCII code-point sorting order. More...

class	jau::lang::token_fsm< State_type >
	A lexical analyzer (tokenizer) using a tabular finite-state-machine (FSM), aka `endlicher automat` (EA). More...

Functions
bool	jau::lang::operator!= (const alphabet &lhs, const alphabet &rhs) noexcept

bool	jau::lang::operator== (const alphabet &lhs, const alphabet &rhs) noexcept

std::string	jau::lang::to_string (const alphabet &v) noexcept

Detailed Description

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.

Function Documentation

std::string jau::lang::to_string ( const alphabet & v )

inlinenoexcept

Definition at line 114 of file token_fsm.hpp.

bool jau::lang::operator!=	(	const alphabet &	lhs,
		const alphabet &	rhs )

inlinenoexcept

Definition at line 116 of file token_fsm.hpp.

bool jau::lang::operator==	(	const alphabet &	lhs,
		const alphabet &	rhs )

inlinenoexcept

Definition at line 120 of file token_fsm.hpp.