GraFLAP - Automated Grading of Formal Languages and Automata Problems
- Grammars, automata, and machines in theoretical computer science can be viewed as specialized types of programs. Automata and grammars can be graded automatically using sets of words that either belong or don't belong to the corresponding language. For machines, traditional unit testing with predefined input and output can be performed. Additionally, we can verify whether automata, grammars, or machines are of the requested type. Students use JFLAP for constructing and testing automata and machines. Our grading system, GraFLAP, builds upon JFLAP and includes additional testing capabilities. We provide tasks in ProFormA format and utilize Grappa to connect the grader to Moodle.
Download full text files
Additional Services
Statistics
| Author: | Frauke SprengelORCiDGND |
|---|---|
| URN: | urn:nbn:de:bsz:960-opus4-33922 |
| DOI: | https://doi.org/10.25968/opus-3392 |
| Document Type: | Report |
| Language: | English |
| Year of Completion: | 2024 |
| Publishing Institution: | Hochschule Hannover |
| Release Date: | 2024/11/25 |
| Tag: | Computer aided assessment; GraFLAP; Grappa; LMS; ProFormA |
| GND Keyword: | MoodleGND |
| Page Number: | 18 |
| Institutes: | Fakultät IV - Wirtschaft und Informatik |
| DDC classes: | 004 Informatik |
| Licence (German): |  Creative Commons - CC BY - Namensnennung 4.0 International |
