rlsm 0.2.4
This is a ruby implementation of three concepts: - Deterministic Finite Automata (DFA) - Regular Expressions (in the sense of theoretical computer sience) - Monoids (an algebraic construct)
Gemfile:
=
Copier
Copié!
installation:
=
Dépendances de Development (1):
hoe
>= 1.8.2