| 1 | Index: introduction.qbk
|
|---|
| 2 | ===================================================================
|
|---|
| 3 | --- introduction.qbk (revision 50372)
|
|---|
| 4 | +++ introduction.qbk (working copy)
|
|---|
| 5 | @@ -113,7 +113,7 @@
|
|---|
| 6 | tools to generate the code, your lexer will be perfectly integrated with the
|
|---|
| 7 | rest of your program, making it possible to freely access any context
|
|---|
| 8 | information and data structure. Since the C++ compiler sees all the code it
|
|---|
| 9 | -will generate optimal code nomatter what configuration options have been chosen
|
|---|
| 10 | +will generate optimal code no matter what configuration options have been chosen
|
|---|
| 11 | by the user. __lex__ gives you the vast majority of features you could get from a similar
|
|---|
| 12 | __flex__ program without the need to leave C++ as a host language:
|
|---|
| 13 |
|
|---|
| 14 | @@ -137,7 +137,7 @@
|
|---|
| 15 | [heading The Library Structure of __lex__]
|
|---|
| 16 |
|
|---|
| 17 | The [link spirit.lexerflow figure] below shows a high level overview of how the
|
|---|
| 18 | -__lex__ library might be used in an application. __lex__ allows to create
|
|---|
| 19 | +__lex__ library might be used in an application. __lex__ allows creation of
|
|---|
| 20 | lexical analyzers based on patterns. These patterns are regular expression
|
|---|
| 21 | based rules used to define the different tokens to be recognized in the
|
|---|
| 22 | character input sequence. The input sequence is expected to be provided to the
|
|---|
