branch: externals/parser-generator
commit 8e99d0cc99c47d2f83edb3ce2b0fefb7834341a4
Author: Christian Johansson <christ...@cvj.se>
Commit: Christian Johansson <christ...@cvj.se>
Fixed typo
---
README.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.md b/README.md
index 21ccb4b..b0f8400 100644
--- a/README.md
+++ b/README.md
@@ -38,7 +38,7 @@ We use push down transducer (PDT) based algorithms:
Grammar consists of `N`, `T`, `P` and `S`, where `N` is non-terminals, `T` is
terminals, `P` is productions and `S` is start-production. N, T, P consists of
lists of one or more strings and symbols. When initializing grammar you also
set the number of look-ahead to use, like this:
-* N = `'(S A B C)'`
+* N = `'(S A B C)`
* T = `'(a b c)`
* P = `'((S (A B)) (A (B a) e) (B (C b) C) (C c e))`
* S = `'S`
