• OpenGrm

  • Referenced in 2 articles [sw39151]
  • library classes and functions for compiling regular expression and context-sensitive rewrite rules into finite...
  • Alpha

  • Referenced in 6 articles [sw13717]
  • functional language for expressing regular algorithms, synthesizing regular architectures or compiling to sequential or parallel...
  • FSA

  • Referenced in 1 article [sw21341]
  • intersections and unions, compiling a (non-POSIX) regular expression into an FSA, and compiling...
  • Merlin

  • Referenced in 6 articles [sw25230]
  • predicates to identify sets of packets, regular expressions to encode forwarding paths, and arithmetic formulas ... specify bandwidth constraints. The Merlin compiler uses a combination of advanced techniques to translate these...
  • GANIMAL

  • Referenced in 4 articles [sw30822]
  • interactive, multimedia visualizations and animations of compiler phases. Currently the following interactive animations are available ... generation of finite automata from regular expressions and an electronic textbook on generating finite automata...
  • Bex

  • Referenced in 1 article [sw37816]
  • elements of regular expressions, symbolic automata and transducers, and enables a compilation scheme into...
  • Rex

  • Referenced in 1 article [sw36319]
  • application is the generation of scanners for compilers. The generated scanners can handle single byte ... Unicode input. Rex stands for Regular EXpression tool. In principle it is a remake...
  • FatTire

  • Referenced in 2 articles [sw34183]
  • programming construct based on regular expressions that allows developers to specify the set of paths ... required. This construct is implemented by a compiler that targets the in-network fast-failover...
  • InterAspect

  • Referenced in 2 articles [sw13024]
  • directly add instrumentation by transforming the compiler’s intermediate representation. Such transformations, however, require expert ... monitors that are formally specified as regular expressions...
  • Flow Caml

  • Referenced in 6 articles [sw08923]
  • approximation of the information that the described expression may convey. Because it has full type ... standalone, batch-oriented compiler that produces regular OCaml code, or as an interactive, toplevel-based...
  • Par-EXPDE

  • Referenced in 2 articles [sw13627]
  • special programming technique called expression templates that effectively hides the complexity of the underlying data ... patchwise regular refinement of unstructured grid elements to allow for more aggressive compiler optimization...
  • YAKKER

  • Referenced in 2 articles [sw17046]
  • scannerless context-free grammars with (2) regular expressions as right-hand sides for defining nonterminals ... grammar formalization and show how to compile grammars into non deterministic automata. These automata...
  • ACL2

  • Referenced in 283 articles [sw00060]
  • ACL2 is both a programming language in which...
  • Coq

  • Referenced in 1890 articles [sw00161]
  • Coq is a formal proof management system. It...
  • Isabelle

  • Referenced in 713 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • Magma

  • Referenced in 3315 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5373 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6355 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13544 articles [sw00558]
  • MATLAB® is a high-level language and interactive...