Login / Signup

A deterministic parsing algorithm for ambiguous regular expressions.

Angelo BorsottiLuca BreveglieriStefano Crespi-ReghizziAngelo Morzenti
Published in: Acta Informatica (2021)
Keyphrases
  • regular expressions
  • deterministic finite automata
  • learning algorithm
  • computational complexity
  • tree structure
  • metadata
  • optimal solution
  • contextual information
  • matching algorithm