/*
- * Copyright 2001-2006 Adrian Thurston <thurston@cs.queensu.ca>
+ * Copyright 2001-2006 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Ragel.
int length;
InputLoc loc;
- void prepareLitString( Token &result, bool &caseInsensitive );
void append( const Token &other );
void set( const char *str, int len );
};
+char *prepareLitString( const InputLoc &loc, const char *src, long length,
+ long &resLen, bool &caseInsensitive );
+
/* Store the value and type of a priority augmentation. */
struct PriorityAug
{
FsmAp *walk( ParseData *pd );
void makeNameTree( ParseData *pd );
void resolveNameRefs( ParseData *pd );
- void runLonestMatch( ParseData *pd, FsmAp *graph );
+ void transferScannerLeavingActions( FsmAp *graph );
+ void runLongestMatch( ParseData *pd, FsmAp *graph );
Action *newAction( ParseData *pd, const InputLoc &loc, const char *name,
InlineList *inlineList );
void makeActions( ParseData *pd );
};
JoinOrLm( Join *join ) :
- join(join), type(JoinType) {}
+ join(join), longestMatch(0), type(JoinType) {}
JoinOrLm( LongestMatch *longestMatch ) :
- longestMatch(longestMatch), type(LongestMatchType) {}
+ join(0), longestMatch(longestMatch), type(LongestMatchType) {}
FsmAp *walk( ParseData *pd );
void makeNameTree( ParseData *pd );