Proceedings of the 40th ACM Technical Symposium on Computer Science Education 2009
DOI: 10.1145/1508865.1509011
|View full text |Cite
|
Sign up to set email alerts
|

Increasing engagement in automata theory with JFLAP

Abstract: We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our results the majority of students felt that having access to JFLAP made learning course concepts easier, made them feel more engaged in the course and made the course more enjoyable. We also describe changes and additions to JFLAP we have made based on feedback from users. These changes include new algorithms such as a CYK parser and a user-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0
2

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 32 publications
(17 citation statements)
references
References 21 publications
(7 reference statements)
0
13
0
2
Order By: Relevance
“…In the past two decades, a number of visualization and animation tools have been developed and used in many areas of computer science education [17]- [20]. While the achievement of learning outcomes as a result of using visualizations and animations has been mixed, there is evidence indicating that carefully designed visualizations and animations can have beneficial learning outcomes.…”
Section: Discussionmentioning
confidence: 99%
“…In the past two decades, a number of visualization and animation tools have been developed and used in many areas of computer science education [17]- [20]. While the achievement of learning outcomes as a result of using visualizations and animations has been mixed, there is evidence indicating that carefully designed visualizations and animations can have beneficial learning outcomes.…”
Section: Discussionmentioning
confidence: 99%
“…JFLAP [2,3] is software for creating and experimenting with several types of automata and grammars, and for experimenting with related construction-type proofs. With JFLAP one can build an NFA, then go through the steps in converting it to a DFA, then convert it to a minimal state DFA, then convert it to a regular grammar or a regular expression.…”
Section: Description Of Jflapmentioning
confidence: 99%
“…We define [1][2][3][4][5][6][7][8][9] on an arc to define 1+2+3+4+5+6+7+8+9 (1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9) and similar notation for [a-z] and [A-Z].…”
Section: Additions To Jflapmentioning
confidence: 99%
“…One of them involves the lexical and syntactical analysis of source code based on the formal languages theory techniques. Here many tools can be found in the literature as JFlap [13,14] focused on authomata theory and formal languages, and VAST [1], CUPV [6], APA 1 [7] or GYacc [9] focused on parsing algorithms. The other part includes processes like syntax directed translation, with tools like as JACCIE [8], Lisa [11] or VCOCO [12], code generation and execution with tools like the PIPPIN Machine [3] and symbol table use or type checking for which we have not found any visualization tool aimed at education.…”
Section: Introductionmentioning
confidence: 99%