From 81411e14468af3957af4e79608a5bae1a5092bcb Mon Sep 17 00:00:00 2001 From: Christian Nicolai Date: Mon, 1 Aug 2011 19:01:46 +0200 Subject: [PATCH] Updated HowItWorks --- HowItWorks.md | 10 +++++++--- md.jsf | 5 +++-- 2 files changed, 10 insertions(+), 5 deletions(-) diff --git a/HowItWorks.md b/HowItWorks.md index 01b8378..f99d2dd 100644 --- a/HowItWorks.md +++ b/HowItWorks.md @@ -6,15 +6,19 @@ 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 - ': ' +Each state begins with: + + : + \ 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. Within a state, define transitions (jumps) to other states. Each -jump has the form: [