ACM Letters on Programming Languages and Systems (LOPLAS).
The implementation of submatch extraction in re2c is described in the article
-:download:`"Tagged Deterministic Finite Automata with Lookahead" <2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf>`
+`"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:
html_extra_path = [
'CNAME',
'.nojekyll',
- 'feed/'
+ 'feed/',
+ 'about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf'
]
# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
<updated>2017-08-11T00:00:00Z</updated>
<summary type="xhtml">
<div xmlns="http://www.w3.org/1999/xhtml">
- Release re2c-1.0! (<a href="http://re2c.org/news/release_notes/0_16.html">release notes</a>).
+ Release re2c-1.0! (<a href="http://re2c.org/news/release_notes/1_0.html">release notes</a>).
</div>
</summary>
<author>
It was only logical to fix Laurikari algorithm;
but as I worked on it, a couple of other issues showed up,
and so it happened that I ended up writing a whole paper on the subject:
-:download:`"Tagged Deterministic Finite Automata with Lookahead" <../../about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf>`.
+`"Tagged Deterministic Finite Automata with Lookahead" <../../2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf>`_
Submatch extraction in re2c comes in two flavors:
POSIX-compliant capturing groups (with true POSIX semantics)