Abstract
We describe L-FLAT, a Logtalk Toolkit for teaching For-mal Languages and Automata Theory. L-FLAT supports the definitionof alphabets, the definition of orders over alphabet symbols, the partialdefinition 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 bysupporting Mooshak, a web application that features automatic gradingof submitted programs.
| Original language | Unknown |
|---|---|
| Title of host publication | Proceedings of the 11th Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011) |
| Pages | 17 pages |
| Publication status | Published - 1 Jan 2011 |
| Event | 11th Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011) - Duration: 1 Jan 2011 → … |
Conference
| Conference | 11th Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011) |
|---|---|
| Period | 1/01/11 → … |