Updated HowItWorks

This commit is contained in:
Christian Nicolai 2011-08-01 18:56:59 +02:00
parent 03523d5ac6
commit 26bf96cc4c
1 changed files with 3 additions and 2 deletions

View File

@ -6,8 +6,9 @@ A (deterministic) state machine which performs lexical analysis of C.
program could be used to convert a regular expression NFA syntax into this
format).
Each state begins with ':<name> <color-name>'
<color-name> is the color used for characters eaten by the state
Each state begins with
':<name> <color-name>'
\<color-name\> is the color used for characters eaten by the state
(really a symbol for a user definable color).
The first state defined is the initial state.