The MatchPy module offers efficient pattern matching in Python, similar to pattern matching in Mathematica. To make this type of pattern matching available in more languages, we want to reimplement MatchPy in C (not C++).
The algorithms implemented in MatchPy are mostly based on deterministic and non-deterministic automata. In the non-deterministic case, we use backtracking to find all possible solutions.
Requirements
- Very good knowledge of C.
- Ability to write readable, structured and documented code.
- Knowledge of Python and automata theory is beneficial.
Contact
Henrik Barthels
barthels@aices.rwth-aachen.de
High-Performance and Automatic Computing (HPAC)
http://hpac.rwth-aachen.de