RubyGems Navigation menu

fa 0.1.1

Bindings for libfa, a library to manipulate finite automata. Automata are constructed from regular expressions, using extended POSIX syntax, and make it possible to compute interesting things like the intersection of two regular expressions (all strings matched by both), or the complement of a regular expression (all strings _not_ matched by the regular expression). It is possible to convert from regular expression (compile) to finite automaton, and from finite automaton to regular expression (as_regexp)

Gemfile:
= Copy to clipboard Copied!

install:
=

Versions:

  1. 0.1.1 - September 17, 2017 (11.5 KB)
  2. 0.1.0 - September 17, 2017 (8 KB)

Runtime Dependencies (1):

ffi >= 0

Development Dependencies (4):

bundler ~> 1.14
minitest ~> 5.0
rake ~> 10.0
yard >= 0

Owners:

Authors:

  • David Lutterkort

SHA 256 checksum:

6d44624ff115c504f35a541b50444d884ab96efee9196e41323bd7c3a06f7a8f

Total downloads 4,775

For this version 2,894

License:

MIT

Required Ruby Version: >= 0

Links: