Skip to content

Latest commit

 

History

History
11 lines (7 loc) · 569 Bytes

README.md

File metadata and controls

11 lines (7 loc) · 569 Bytes

tree-io

A fast regular expression engine that produces parse trees (ASTs). It does so in linear time in the size of the text matched and scales in O(m*log(m)) in the size of the pattern.

Algorithm

The algorithm is described in

  • Niko Schwarz. Scaleable Code Clone Detection. PhD thesis, University of Bern, February 2014. PDF
  • Aaron Karper. Efficient regular expressions that produce parse trees. Master thesis, University of Bern, December 2014. PDF