From faa2e5223be03d9cffe68b0182f20291c38cad03 Mon Sep 17 00:00:00 2001 From: Oppodelldog Date: Wed, 13 Dec 2017 00:55:48 +0100 Subject: [PATCH] fixed typo in README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 5110f31..7a34a31 100644 --- a/README.md +++ b/README.md @@ -388,7 +388,7 @@ was no error: ### Dealing with Non-regular Tokens `lexmachine` like most lexical analysis frameworks primarily deals with patterns -which an be represented by regular expressions. However, sometimes a language +which are represented by regular expressions. However, sometimes a language has a token which is "non-regular." A pattern is non-regular if there is no regular expression (or finite automata) which can express the pattern. For instance, if you wanted to define a pattern which matches only consecutive