From: Ulya Trofimovich Date: Wed, 16 Aug 2017 12:10:36 +0000 (+0100) Subject: Updated 'About' page. X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=d020a62d01cce920bbda9655b4c24ac01332bf2d;p=re2c Updated 'About' page. --- diff --git a/src/about/about.rst b/src/about/about.rst index de4c2398..0294a888 100644 --- a/src/about/about.rst +++ b/src/about/about.rst @@ -8,26 +8,25 @@ About Authors ------- -Originally written by Peter Bumbulis (peter@csg.uwaterloo.ca) +re2c was originally written by Peter Bumbulis (peter@csg.uwaterloo.ca) and described in research article -:download:`"RE2C: a more versatile scanner generator" <1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>` +`"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). - -The implementation of submatch extraction in re2c is described in the article +Since then re2c has been maintained and developed by multiple volunteers, +most notably, +Brian Young (bayoung@acm.org), +Markus Boerger (helly@users.sourceforge.net), +Dan Nuffer (nuffer@users.sourceforge.net) +and Ulya Trofimovich (skvadrik@gmail.com). +Recent development of re2c is described in research article `"Tagged Deterministic Finite Automata with Lookahead" <../2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf>`_ by Ulya Trofimovich, 2017. +Below is the list of re2c contributors: +many are mentioned by their nicknames and some may be missing. +`Let me know `_ if you feel that this list should be amended: -Since then many people have contributed to re2c: - -* Brian Young bayoung@acm.org -* Dan Nuffer nuffer@users.sourceforge.net -* Marcus Boerger helly@users.sourceforge.net -* Hartmut Kaiser hkaiser@users.sourceforge.net -* Emmanuel Mogenet mgix@mgix.com -* Ulya Trofimovich skvadrik@gmail.com - -Let me know if I missed someone! +.. include:: contributors.rst License ------- @@ -40,7 +39,6 @@ or binary, unchanged or modified. Distributors may charge whatever fees they can obtain for re2c. If you do make use of re2c, or incorporate it into a larger project an acknowledgement somewhere (documentation, research report, etc.) would be appreciated. - re2c is distributed with no warranty whatsoever. The code is certain to contain errors. Neither the author nor any contributor takes responsibility for any consequences of its use. diff --git a/src/about/contributors.rst b/src/about/contributors.rst new file mode 100644 index 00000000..541be107 --- /dev/null +++ b/src/about/contributors.rst @@ -0,0 +1,34 @@ +Abs62, +asmwarrior, +Ben Smith, +Brian Young, +CRCinAU, +Dan Nuffer, +Derick Rethans, +Dimitri John Ledkov, +Eldar Zakirov, +Emmanuel Mogenet, +Hartmut Kaiser, +jcfp, +Jean-Claude Wippler, +Jeff Trull, +Jérôme Dumesnil, +Jesse Buesking, +joscherl, +Julian Andres Klode, +Marcus Boerger, +Mike Gilbert, +nuno-lopes, +Oleksii Taran, +paulmcq, +Paulo Custodio, +Perry E. Metzger, +philippschaefer, +Ross Burton, +Rui Maciel, +Ryan Mast, +Samuel006, +Sergei Trofimovich, +sirzooro, +Tim Kelly, +Ulya Trofimovich diff --git a/src/conf.py b/src/conf.py index 6574b746..008661c4 100644 --- a/src/conf.py +++ b/src/conf.py @@ -78,6 +78,7 @@ language = None # directories to ignore when looking for source files. exclude_patterns = [ 'examples/06_braille.utf8.txt.rst', + 'about/contributors.rst', 'manual/features/skeleton/example.rst', 'manual/features/skeleton/failures.rst', 'manual/features/skeleton/generating_data.rst', @@ -184,6 +185,7 @@ html_extra_path = [ 'CNAME', '.nojekyll', 'feed/', + 'about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf', 'about/2017_trofimovich_tagged_deterministic_finite_automata_with_lookahead.pdf' ] diff --git a/src/examples/example_02.rst b/src/examples/example_02.rst index 755118b1..399241f0 100644 --- a/src/examples/example_02.rst +++ b/src/examples/example_02.rst @@ -23,7 +23,7 @@ If the check fails, the lexer calls ``YYFILL(n)``, which may either supply at le For those interested in the internal re2c algorithm used to determine checkpoints, here is a quotation from the original paper -:download:`"RE2C: a more versatile scanner generator" <../about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>` +`"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)*: *A set of key states can be determined by discovering the strongly-connected components (SCCs) of the diff --git a/src/index.rst b/src/index.rst index 37cc7e43..9bc56b00 100644 --- a/src/index.rst +++ b/src/index.rst @@ -21,6 +21,9 @@ re2c applies quite a few optimizations in order to speed up and compress the gen Another distinctive feature is its flexible interface: instead of assuming a fixed program template, re2c lets the programmer write most of the interface code and adapt the generated lexer to any particular environment. +For a step-by-step introduction, see `examples `_. +For complete overview, see the `manual `_. + Features diff --git a/src/news/release_notes/1_0.rst b/src/news/release_notes/1_0.rst index 49336a8c..ecae4ce2 100644 --- a/src/news/release_notes/1_0.rst +++ b/src/news/release_notes/1_0.rst @@ -7,7 +7,7 @@ Release 1.0 This release is an important milestone in the history of re2c: it adds *submatch extraction*. It is a long-awaited feature; even as Peter Bumbulis released the first version of re2c back in 1993, he mentioned submatch extraction in his paper together with Donald D. Cowan -:download:`"RE2C: a more versatile scanner generator" <../../about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>` +`"RE2C: a more versatile scanner generator" <../../1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`_ as a useful feature that soon should be added to re2c. It seemed back then that submatch extraction is relatively easy to implement; like many other useful extensions, it was deemed to be no more than syntactic sugar on top of canonical regular expressions.