This is a limited proof of concept to search for research data, not a production system.

Search the MIT Libraries

Title: O(n m) regular expression parsing library that produces parse trees

Type Software Niko Schwarz, Aaron Karper (2014): O(n m) regular expression parsing library that produces parse trees. Zenodo. Software. https://zenodo.org/record/10861

Authors: Niko Schwarz (University of Bern) ; Aaron Karper (University of Bern) ;

Links

Summary

A linear regular expression engine that produces parse trees (ASTs).

More information

  • DOI: 10.5281/zenodo.10861

Subjects

  • automata, regular expressions

Dates

  • Publication date: 2014
  • Issued: July 14, 2014

Rights


Much of the data past this point we don't have good examples of yet. Please share in #rdi slack if you have good examples for anything that appears below. Thanks!

Format

electronic resource

Relateditems

DescriptionItem typeRelationshipUri
IsSupplementTohttps://github.com/zombiecalypse/tree-regex/tree/v1.0
IsPartOfhttps://zenodo.org/communities/zenodo