L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory

Abstract. We describe L-FLAT, a Logtalk Toolkit for teaching For-mal Languages and Automata Theory. L-FLAT supports the definition of alphabets, the definition of orders over alphabet symbols, the partial definition of languages using unit tests, and the definition of mecha-nisms, which implement language generators or language recognizers. Supported mechanisms include predicates, regular expressions, finite au-tomata, context-free grammars, Turing machines, and push-down au-tomata. L-FLAT entities are implemented using the object-oriented fea-tures of Logtalk, providing a highly portable and easily extendable frame-work. The use of L-FLAT in educational environments is enhanced by supporting Mooshak, a web application that features automatic grading of submitted programs