2 citations · 2 across the 3 of their papers we have counts for
3 papers
A parallel parser for regular expressions
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi +1
Regular expression (RE) matching is a very common functionality that scans a text to find occurrences of patterns specified by an RE; it includes the simpler function of RE recogni…
Minimizing speculation overhead in a parallel recognizer for regular texts
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi +1
Speculative data-parallel algorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministi…
A closer look at TDFA
Angelo Borsotti, Ulya Trafimovich
We present an algorithm for regular expression parsing and submatch extraction based on tagged deterministic finite automata. The algorithm works with different disambiguation poli…