Skip to content

Experimental subword construction algorithm for adp-multi using monadiccp

License

Notifications You must be signed in to change notification settings

adp-multi/adp-multi-monadiccp

Repository files navigation

adp-multi-monadiccp Build Status

This library contains an alternative implementation of the ADP.Multi.Rewrite.* modules in adp-multi. It uses the same model (ADP.Multi.Rewriting.Model) for rewriting functions, but implements a different subword construction algorithm using the OvertonFD constraint solver implemented within the constraint programming framework monadiccp.

It was developed as an experiment to reduce code size and eventually be able to generically construct subwords for any dimension. At the moment, it is slower than the standard implementation and supports one- and two-dimensional nonterminals only.

How to use

  1. Check out the git repository
  2. Run cabal install inside the checked out folder
  3. Add adp-multi-monadiccp as a dependency to your cabal project
  4. Instead of importing ADP.Multi.Rewriting.All in your grammar files, import ADP.Multi.Constraint.All

The library is also published on Hackage.

About

Experimental subword construction algorithm for adp-multi using monadiccp

Resources

License

Stars

Watchers

Forks

Packages

No packages published