Added paper on Lookahead TDFA.

diff --git a/src/about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf b/src/about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf
new file mode 100644 (file)
index 0000000..1622016
Binary files /dev/null and b/src/about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf differ

diff --git a/src/about/about.rst b/src/about/about.rst
index 4ab5267ccf1da87b06b58b974b46cd6e35c40a3c..a554c5cc4ee0bbe1e96f99873286500852b94b53 100644 (file)
--- a/src/about/about.rst
+++ b/src/about/about.rst
@@ -14,6 +14,10 @@ and described in research article
 by Peter Bumbulis, Donald D. Cowan, 1994,
 ACM Letters on Programming Languages and Systems (LOPLAS).
 
+The implementation of submatch extraction in RE2C is described in article
+:download:`"Tagged Deterministic Finite Automata with Lookahead" <2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf>`
+by Ulya Trofimovich, 2017.
+
 Since then many people have contributed to re2c:
 
 * Brian Young      bayoung@acm.org