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

安装:
=

版本列表:

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

Runtime 依赖 (1):

ffi >= 0

Development 依赖 (3):

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

业主:

作者:

  • David Lutterkort

SHA 256 校验和:

=

下载总量 5,266

这个版本 2,092

版本发布:

许可:

MIT

需要的 Ruby 版本: >= 0

链接: