• Corpus ID: 17107553

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

@article{Moura2011LFLATLT,
  title={L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory},
  author={Paulo Moura and Artur Miguel Dias},
  journal={ArXiv},
  year={2011},
  volume={abs/1112.3783}
}
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… 

Figures from this paper

A JFLAP Extension for Checking Context-Free Grammars
TLDR
A JFLAP extension for checking homework assignments involving the design of context-free grammars (CFGs) and verifying that student CFGs match the instructor’s CFG for all strings of length up to L (an instructor-supplied parameter).
Didactic Strategy for Learning Theory of Automata & Formal Languages:
TLDR
A didactic strategy to simplify the hardness of the courses on formal languages and automata theory and aids to increase the interest and commitment of students in these courses are presented.
Evaluation of simulation systems suitable for teaching compiler construction courses
TLDR
Evaluation criteria have been defined, and they have been used in the process of evaluation of the selected simulators, and the results of the evaluation will be useful to instructors when choosing a simulator suitable for teaching their courses.

References

SHOWING 1-10 OF 12 REFERENCES
A prolog toolkit for formal languages and automata
TLDR
The declarative, non-deterministic, and interactive nature of Prolog helps in building an executable specification of FLAT concepts and definitions that can be actively extended and explored by students, in order to achieve the stated goal.
JFLAP: An Interactive Formal Languages and Automata Package
TLDR
This guide guides students interactively through many of the concepts in an automata theory course or the early topics in a compiler course, including the descriptions of algorithms JFLAP has implemented.
Programming Patterns for Logtalk Parametric Objects
TLDR
A survey of programming patterns for Logtalk parametric objects is presented, showing how object proxies allow application memory footprint to be minimized while still taking full advantage of Logtalk object-oriented features for representing and reasoning with taxonomic knowledge.
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
TLDR
The FSA Utilities toolbox: a collection of utilities to manipulate finite-state automata and finite- state transducers, which includes determinization, minimization, composition, complementation, intersection, Kleene dosure, etc.
Logtalk-Design of an Object-Oriented Logic Programming Language
TLDR
Logtalk is designed as an extension to the Prolog logic programming language providing encapsulation features based on objectoriented concepts, including support for both prototypes and classes in the same application, integration of event-driven programming with objectoriented programming, and category-based code reusing.
Mooshak: a Web‐based multi‐site programming contest system
TLDR
The Mooshak system acts as a full contest manager as well as an automatic judge for programming contests and has built‐in safety measures to prevent users from interfering with the normal progress of contests.
L-FLAT: Logtalk Toolkit for Formal Languages and Automata
  • http://code.google.com/p/lflat/
  • 2009
P-FLAT: Prolog Toolkit for Formal Languages and Automata
  • http://ctp.di.fct.unl.pt/~amd/lfa/pflat/
  • 2007
Formal Languages and Automata: 298 Slides
  • Universidade Nova de Lisboa, Portugal
  • 2003
FSA6.2xx: Finite State Automata Utilities
  • http://www.let.rug. nl/~vannoord/Fsa/
  • 2009
...
...