Computer Science – Programming Languages
Scientific paper
2011-12-16
Computer Science
Programming Languages
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 201
Scientific paper
We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of \textsl{alphabets}, the definition of \textsl{orders} over alphabet symbols, the partial definition of \textsl{languages} using unit tests, and the definition of \textsl{mechanisms}, which implement language generators or language recognizers. Supported mechanisms include \textsl{predicates}, \textsl{regular expressions}, \textsl{finite automata}, \textsl{context-free grammars}, \textsl{Turing machines}, and \textsl{push-down automata}. L-FLAT entities are implemented using the object-oriented features of Logtalk, providing a highly portable and easily extendable framework. The use of L-FLAT in educational environments is enhanced by supporting Mooshak, a web application that features automatic grading of submitted programs.
Dias Artur Miguel
Moura Paulo
No associations
LandOfFree
L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-136745