Increasing engagement in automata theory with JFLAP

被引：18

作者：

Duke University, Durham, NC, United States ^{[1
]}

不详 ^{[2
]}

不详 ^{[3
]}

机构：

[1] Duke University, Durham, NC

[2] NC State University, Raleigh, NC

[3] Georgia Tech, Atlanta, GA

来源：

SIGCSE Bull. Inroads | 2009年 / 1卷 / 403-407期

关键词：

Automata; cyk parser; formal languages; jflap; pumping lemma;

D O I：

10.1145/1539024.1509011

中图分类号：

学科分类号：

摘要：

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-controlled parser, and new resources that include a JFLAP online tutorial, a wiki and a listserv.

引用

页码：403 / 407

页数：4

共 23 条

[1]

Adar E., Guess: A language and interface for graph exploration, SIGCHI, pp. 347-363, (2006)

[2]

Barwise J., Etchemendy J., Turing's World 3.0 for the Macintosh, (1993)

[3]

Berque D., and et al., The SetPlayer System: An Overview and a User Manual, (1991)

[4]

Berry J., Improving discrete mathematics and algorithms curricula with link. In ACM, SIGCSE/SIGCUE Conference on Integrating Technology in Computer Science Education, (1997)

[5]

Brown M., Exploring algorithms using balsa-ii, Computer, 21, 2, pp. 14-36, (1988)

[6]

Gloor P., Aace - algorithm animation for computer science education, Proceedings of the 1992 IEEE Workshop on Visual Languages, pp. 25-31, (1992)

[7]

Grinder M.T., A preliminary empirical evaluation of the effectiveness of a finite state automaton animator. In Thirty-fourth SIGCSE Technical Symposium on Computer Science Education, SIGCSE, pp. 157-161, (2003)

[8]

Hundhausen C., Douglas S., Stasko J., A meta-study of algorithm visualization effectiveness, Journal of Visual Languages and Computing, 13, 3, pp. 259-290, (2002)

[9]

Jarvis J., Lucas J., Incorporating transformations into jflap for enhanced understanding of automata. In Thirty-ninth SIGCSE Technical Symposium on Computer Science Education, SIGCSE, pp. 14-18, (2008)

[10]

Linz P., An Introduction to Formal Languages and Automata, (2006)

← 1 2 3 →