diff --git a/documentation/trunk/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki b/documentation/trunk/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki index d814d881..0ccae9fe 100644 --- a/documentation/trunk/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki +++ b/documentation/trunk/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki @@ -194,7 +194,7 @@ The basic procedure for analyzing successive tokens in the text is get_t * other_possible_tokens, an array giving all the other possible token types of the last token. (If token_type is No_token the array is empty.) * end_of_text, a boolean attribute used to record whether the end of text has been reached. If so, subsequent calls to get_token will have no effect. -Procedure get_token recognizes the longest possible token. So if <, = and <= are all regular expressions in the grammar, the analyzer recognizes <= as one token, rather than < followed by =. You can use other_possible_tokens to know what shorter tokens were recognized but not retained. +Procedure get_token recognizes the longest possible token. So if <, = and <= are all regular expressions in the grammar, the analyzer recognizes <= as one token, rather than < followed by =. You can use other_possible_tokens to know what shorter tokens were recognized but not retained. If it fails to recognize a regular expression, get_token sets token_type to No_token and advances the input cursor by one character. @@ -565,14 +565,3 @@ When you create a tool, it is by default invisible to clients. To make it visibl If the analysis encounters a token that belongs to two or more different selected regular expressions, the one entered last takes over. Others are recorded in the array other_possible_tokens. If you do not explicitly give an integer value to a regular expression, its default value is its rank in tool_list. - - - - - - - - - - -