Open AccessRE2C: A lexer generator based on lookahead-TDFA
Author(s) -
Ulya Trofimovich
Publication year - 2020
Publication title -
software impacts
Language(s) - English
Resource type - Journals
ISSN - 2665-9638
DOI - 10.1016/j.simpa.2020.100027
Subject(s) - computer science , compiler , generator (circuit theory) , state (computer science) , algorithm , programming language , physics , power (physics) , quantum mechanics
RE2C is a regular expression compiler: it transforms regular expressions into finite state machines and encodes them as programs in the target language. At the core of RE2C is the lookahead-TDFA algorithm that allows it to perform fast and lightweight submatch extraction. This article describes the algorithm used in RE2C and gives an example of TDFA construction.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom