re2c-{{ version }}
</div>
-<h3>Sitemap</h3>
+<h3>Documentation</h3>
{{ toctree(includehidden=True, maxdepth=1) }}
<h3>Community</h3>
Originally written by Peter Bumbulis (peter@csg.uwaterloo.ca)
and described in research article
-`"RE2C: a more versatile scanner generator" <1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`_
+:download:`"RE2C: a more versatile scanner generator" <1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`
by Peter Bumbulis, Donald D. Cowan, 1994,
ACM Letters on Programming Languages and Systems (LOPLAS).
# Add any extra paths that contain custom files (such as robots.txt or
# .htaccess) here, relative to this directory. These files are copied
# directly to the root of the documentation.
-html_extra_path = ['CNAME', '.nojekyll']
+html_extra_path = [
+ 'CNAME',
+ '.nojekyll'
+]
# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
# using the given strftime format.
For those interested in the internal re2c algorithm used to determine checkpoints,
here is a quote from the original paper
-`"RE2C: a more versatile scanner generator" <../about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`_
+:download:`"RE2C: a more versatile scanner generator" <../about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`
by Peter Bumbulis, Donald D. Cowan, 1994, ACM Letters on Programming Languages and Systems (LOPLAS):
*A set of key states can be determined by discovering the strongly-connected components (SCCs) of the