branch: externals/tNFA
commit b035e48a7f54ba067dc098451e7bb7ae8e712a34
Author: Toby Cubitt <toby-predict...@dr-qubit.org>
Commit: Toby S. Cubitt <toby-predict...@dr-qubit.org>
Removed left-over debugging code and other minor tidying.
---
tNFA.el | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/tNFA.el b/tNFA.el
index 90f4511..9cb273b 100644
--- a/tNFA.el
+++ b/tNFA.el
@@ -40,7 +40,7 @@
;; Why re-implement regular expression matching when Emacs comes with
;; extensive built-in support for regexps? Primarily, because some
;; algorithms require access to the NFA states produced part way through
-;; the regular expression matching process (see `tries.el' for an
+;; the regular expression matching process (see `trie.el' for an
;; example). Secondarily, because Emacs regexps only work on strings,
;; whereas regular expressions can equally well be used to specify other
;; sequence types.
@@ -167,7 +167,7 @@
(tag &optional next
&aux
(type 'tag)
- (label (progn (message "%d" tag) tag))
+ (label tag)
(in-degree 0)
(count 0)
(id (incf NFA--state-id))
