From 26bf96cc4caef48829bc8d890f8e0a7b0bb4ee44 Mon Sep 17 00:00:00 2001
From: Christian Nicolai <chrnicolai@gmail.com>
Date: Mon, 1 Aug 2011 18:56:59 +0200
Subject: [PATCH] Updated HowItWorks

---
 HowItWorks.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/HowItWorks.md b/HowItWorks.md
index e983eb1..01b8378 100644
--- a/HowItWorks.md
+++ b/HowItWorks.md
@@ -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.