Marcelo Lazaroni • 3/10/2020

Fast parsing of String Sets in Elm

This technical article details the inefficiencies of using Elm's Parser.oneOf with backtrackable for matching a predefined set of strings. It proposes and begins to explain a more efficient solution by grouping matches by their starting characters, effectively building a prefix tree (trie) to minimize character re-examination and enable faster failure.

0 comments

#performance #elm #algorithm