article

Free access

A collection of tools for making automata theory and formal languages come alive

Authors:

Edwin TsangAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 29, Issue 1

Pages 15 - 19

https://doi.org/10.1145/268085.268089

Published: 01 March 1997 Publication History

PDF eReader

Abstract

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; Pâté for parsing restricted and unrestricted grammars and transforming context-free grammars to Chomsky Normal Form; and PumpLemma for proving specific languages are not regular. Enhancements to previous tools LLparse and LRparse, instructional tools for parsing LL(1) and LR(1) grammars, include parsing LL(2) grammars, displaying parse trees, and parsing any context-free grammar with conflict resolution.

References

[1]

A. Badre, C. Lewis, and J. Stasko, Empirically Evaluating the Use of Animations to Teach Algorithms, Proceedings of the 1994 IEEE Symposium on Visual Languages, p. 48-54, 1994.

Google Scholar

[2]

J. Barwise andJ. Etchemedy, Turing's World, Stanford: CSLI Publications, New York: Cambridge University Press, 1993.

Google Scholar

[3]

S. Blythe, M. James, S. Rodger, LLparse and LRparse: Visual and Interactive Tools for Parsing, Twenty-fifth SIGCSE Technical Symposium on Computer Science Education, p. 208-212, 1994.

Digital Library

Google Scholar

[4]

M. Brown, ZEUS: A System for algorithm animation and multi-view editing. Proceedings of the IEEE 1991 Workshop on Visual Languages, p. 4-9, Kobe, Japan, Oct. 1991.

Crossref

Google Scholar

[5]

P. Gloor, AACE - Algorithm Animation for Computer Science Education, IEEE Workshop on Visual Languages, p. 25-31, 1992.

Crossref

Google Scholar

[6]

D. Hannay, Hypercard Automata Simulation: Finite State, Pushdown and Turing Machines, SIGCSE Bulletin, 24, 2, p. 55-58, June 1992.

Digital Library

Google Scholar

[7]

M. LoSacco, and S. Rodger, FLAP: A Tool for Drawing and Simulating Automata, ED-MEDIA 93, World Conference on Educational Multimedia and Hypermedia, p. 310-317, June 1993.

Google Scholar

[8]

S. Rodger, An Interactive Lecture Approach to Teaching Computer Science, Proceedings of the Twenty-sixth SIGCSE Technical Symposium on Computer Science Education, p.278-282, 1995.

Digital Library

Google Scholar

[9]

S. Rodger, Integrating Hands-On Work into the Formal Languages Course via Tools and Programming, First International Workshop on Implementing Automata, London, Ontario, 1996, (to appear).

Digital Library

Google Scholar

[10]

M. Proeopiue, O. Procopiue, and S. Rodger, "Visualization and Interaction in the Computer Science Forreal Languages Course with JFLAP" 1996 Frontiers in Education Conference, Salt Lake City, Utah, 1996, (to appear).

Digital Library

Google Scholar

[11]

J. Stasko, Tango: A Framework and System for Algorithm Animation, IEEE Computer, p.27-39, September 1990.

Digital Library

Google Scholar

[12]

K. Sutner, Implementing Finite State Machines, in Computational Support for Discrete Mathematics, D1- MACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15, N. Dean and G. E. Shannon (ed.), American Mathematical Society, p. 347-363, 1992.

Google Scholar

Cited By

View all

Jacobson IStimson R(2018)Tear Down the Method Prisons! Set Free the Practices!Queue10.1145/3291276.330176016:5(101-127)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3301760
Garfinkel SAbowd JMartindale C(2018)Understanding Database Reconstruction Attacks on Public DataQueue10.1145/3291276.329569116:5(28-53)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3295691
Sites R(2018)Benchmarking "Hello, World!"Queue10.1145/3291276.329127816:5(54-80)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3291278
Show More Cited By

Index Terms

A collection of tools for making automata theory and formal languages come alive

Recommendations

A collection of tools for making automata theory and formal languages come alive
SIGCSE '97: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; P&...
Formal languages and their relation to automata
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications V

Limited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 29, Issue 1

March 1997

388 pages

ISSN:0097-8418

DOI:10.1145/268085

Issue’s Table of Contents

SIGCSE '97: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
March 1997
410 pages
ISBN:0897918894
DOI:10.1145/268084
Chairmen:
Curt M. White
Rosary College, River forest, IL
,
Carl Erickson
Grand Valley State Univ., Allendale MI
,
Bruce Klein
Grand Valley State Univ., Allendale, MI
,
Editor:
James E. Miller
Univ. of Southern Mississippi, Hattiesburg

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1997

Published in SIGCSE Volume 29, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
899
Total Downloads

Downloads (Last 12 months)168
Downloads (Last 6 weeks)20

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jacobson IStimson R(2018)Tear Down the Method Prisons! Set Free the Practices!Queue10.1145/3291276.330176016:5(101-127)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3301760
Garfinkel SAbowd JMartindale C(2018)Understanding Database Reconstruction Attacks on Public DataQueue10.1145/3291276.329569116:5(28-53)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3295691
Sites R(2018)Benchmarking "Hello, World!"Queue10.1145/3291276.329127816:5(54-80)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3291276.3291278
Kwon YYu HPeter SRossbach CWitchel E(2017)IngensACM SIGOPS Operating Systems Review10.1145/3139645.313965951:1(83-93)Online publication date: 11-Sep-2017
https://dl.acm.org/doi/10.1145/3139645.3139659
Calciu ISen SBalakrishnan MAguilera M(2017)How to implement any concurrent data structure for modern serversACM SIGOPS Operating Systems Review10.1145/3139645.313965051:1(24-32)Online publication date: 11-Sep-2017
https://dl.acm.org/doi/10.1145/3139645.3139650
Budiu MDodd C(2017)The P416 Programming LanguageACM SIGOPS Operating Systems Review10.1145/3139645.313964851:1(5-14)Online publication date: 11-Sep-2017
https://dl.acm.org/doi/10.1145/3139645.3139648
Decker ASimkins D(2016)Uncovering difficulties in learning for the intermediate programmer2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757446(1-8)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757446
Decker AEgert CPhelps A(2016)Splat! er, shmup? A postmortem on a capstone production experience2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757399(1-9)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757399
Altarawneh RHumayoun S(2013)A Two-Perspective Visualization Approach for Utilizing Visualization Power in Computer Science EducationProceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research10.5555/2541917.2541925(85-91)Online publication date: 4-Apr-2013
https://dl.acm.org/doi/10.5555/2541917.2541925
Chakraborty PSaxena PKatti C(2011)Fifty years of automata simulationACM Inroads10.1145/2038876.20388932:4(59-70)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1145/2038876.2038893
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations