RubyGems Navigation menu

fa 0.1.0

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:
=

installation:
=

Versions:

  1. 0.1.1 September 17, 2017 (11,5 ko)
  2. 0.1.0 September 17, 2017 (8 ko)

Dépendances de Runtime (1):

ffi >= 0

Dépendances de Development (3):

bundler ~> 1.14
minitest ~> 5.0
rake ~> 10.0

Propriétaires:

Auteurs:

  • David Lutterkort

Total de contrôle SHA 256:

=

Total de téléchargements 5 266

Pour cette version 2 092

Version publiée:

License:

MIT

Version de Ruby requise: >= 0

Liens: