From 22b8895dcf06e4abb4bb7942c51a42b02ed5408a Mon Sep 17 00:00:00 2001 From: halw Date: Wed, 10 Dec 2008 05:29:55 +0000 Subject: [PATCH] Author:halw Date:2008-12-10T05:29:55.000000Z git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@134 abb3cda0-5349-4a8f-a601-0c33ac3a8c38 --- .../text-processing/eiffellex/eiffellex-tutorial.wiki | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/documentation/current/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki b/documentation/current/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki index 544a9ea9..33666811 100644 --- a/documentation/current/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki +++ b/documentation/current/solutions/text-processing/eiffellex/eiffellex-tutorial.wiki @@ -227,6 +227,7 @@ The Lex library supports a powerful set of construction mechanisms for describin Let us now study the format of regular expressions. This format is used in particular for the lexical grammar files needed by class [[ref:/libraries/lex/reference/scanning_chart|SCANNING]] and (as seen below) by procedure read_grammar of class [[ref:/libraries/lex/reference/metalex_chart|METALEX]] . The ''eiffel_regular'' grammar file in the examples directory provides an extensive example. Each regular expression denotes a set of tokens. For example, the first regular expression seen above,
+ '0'..'9' @@ -299,7 +300,7 @@ Concatenations may be inconvenient when the concatenated elements are simply cha More generally, a string is written "a 1 a 2 ... a n" for ''n >= 0'', where the "a i" are characters, and is an abbreviation for the concatenation 'a 1' 'a 2' ... 'a n', representing a set containing a single token. In a string, the double quote character " is written \" and the backslash character \ is written \\. No other special characters are permitted; if you need special characters, use explicit concatenation. As a special case, "" represents the set containing a single empty token. -A union, writtenexp 1 | exp 2 | ... | exp n, describes the set of tokens which are specimens of exp 1, or of exp 2, etc. For example, the union ''('a'..'z') | ('A'..'Z')'' describes the set of single-letter tokens (lower-case or upper-case). +A union, written exp 1 | exp 2 | ... | exp n, describes the set of tokens which are specimens of exp 1, or of exp 2, etc. For example, the union ''('a'..'z') | ('A'..'Z')'' describes the set of single-letter tokens (lower-case or upper-case). ===Predefined expressions===