Click here to Skip to main content
15,880,651 members
Articles / Programming Languages / C++

Tokenizer and analyzer package supporting precedence prioritized rules

Rate me:
Please Sign up or sign in to vote.
5.00/5 (4 votes)
1 Jan 20023 min read 180.7K   2.8K   54  
A library allowing you to conveniently build a custom tokenizer and analyzer supporting precedence priorized rules
#ifndef _LEXXER_FLAGS_DEFINED
#define _LEXXER_FLAGS_DEFINED

// LexxerTokenRules flags ...
enum	xttr_flags	
	{
	ttrf_character_rule=1,		// token consists only of ordered characters
	ttrf_computed_rule=0,		//   otherwise: token is being computed

	ttrf_intermediate=2,		// token is complete immediately after recognition
	ttrf_not_intermediate=0,	//   otherwise: token is complete only if the full token text
								//              (seperated by a 'within' token) is equal

	ttrf_within=4,				// token can appear within other tokens (like C++ '+')
	ttrf_seperate=0,			// token can appear only as a unit

	ttrf_dummy=8,				// token is just a dummy and will not be used
	};

// LexxerContext flags
enum	xtctx_flags	
	{
	tctx_exclusive=1
	};

#endif

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Web Developer
Germany Germany
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions