Scanner efficiency and GOTO in Ada

Scanner efficiency and GOTO in Ada

[Wolfgang Gellerich]

Hello Everyone,

A few months ago, there was a thread concerning GOTO usage in Ada
which led to a discussion on how to implement scanners efficiently. I
mentioned our experimental evaluation on that topic which, however,
was not completed at that time. Now it is -- for details see the
reference appended below and look on my web page

  http://www.informatik.uni-stuttgart.de/ifi/ps/Gellerich/publications.html


Regards,

  Wolfgang



@INPROCEEDINGS{gellerich:98a,
  AUTHOR = "W. Gellerich and K. Brouwer and E. Ploedereder",
  TITLE = "Myths and Facts about the Efficient Implementation of
           Finite Automata and Lexical Analysis",
  Booktitle = "Proceedings of the International Conference on Compiler
               Construction CC'1998",
  Publisher = "Springer",
  Series    = "LNCS",
  Volume = "1883",
  PAGES = "1-15",
  YEAR = "1998",
  NOTE      = {({\small \tt 
http://www.informatik.uni-stuttgart.de/ifi/ps/Gellerich/publications.html
              })}}


+----------------------------------------------------------------------------+
| Wolfgang Gellerich                   gellerich@informatik.uni-stuttgart.de |
| University of Stuttgart;                                                   |
| Informatics Department; Programming Languages Group;                       |
| Breitwiesenstrasse 20-22; D-70565 Stuttgart; Germany                       |
| Tel. +49-711-7816213  Fax +49-711-7816380                                  |
| http://www.informatik.uni-stuttgart.de/ifi/ps/Gellerich/                   |
| (Amateur Radio : DJ3TZ@DB0RBS.#BW.DEU.EU)           ACM Member No. 4436341 |
+----------------------------------------------------------------------------+