Supervisor

Suitable for

Abstract

A classic paper by Ken Thompson describes a translation of regular expressions into nondeterministic finite automata, with the transition functions of the automota represented as dynamically generated machine code for the IBM 7090 computer. The aim of this project is to recreate Thompson's presentation using a more recent JIT framework called Thunder, yielding a fast implementation of the grep utility for pattern matching in files. Another page has more details and hints.