TY  - RPRT
U1  - Verschiedenartige Texte
A1  - Sprengel, Frauke
T1  - GraFLAP - Automated Grading of Formal Languages and Automata Problems
N2  - 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.
KW  - Computer aided assessment
KW  - GraFLAP
KW  - Grappa
KW  - ProFormA
KW  - LMS
KW  - Moodle
Y2  - 2024
UN  - https://nbn-resolving.org/urn:nbn:de:bsz:960-opus4-33922
U6  - https://doi.org/10.25968/opus-3392
DO  - https://doi.org/10.25968/opus-3392
SP  - 18
S1  - 18
ER  -