ACM Home Page
Please provide us with feedback. Feedback
Animating parsing algorithms
Full text PdfPdf (677 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education table of contents
Atlanta, Georgia, United States
Pages: 232 - 236  
Year of Publication: 1998
ISBN:0-89791-994-7
Also published in ...
Authors
Sami Khuri  Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
Yanti Sugono  Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
Sponsor
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/273133.274303
What is a DOI?

ABSTRACT

The paper describes a package that can be used to present the parsing algorithms. The package fully animates the top-down LL(1) and bottom-up SLR(1) parsing algorithms. By full animation we mean that the input string being parsed, the corresponding actions that take place in the stack, and the building of the parse tree are all simultaneously animated on the same screen, thus enabling the user to get a full appreciation of all the intricate details that occur during parsing. The package makes use of XTANGO and can be used in the beginning of the semester as a teaching tool. Later, the students could be asked to write their own animations of the compiling process.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Barwise, J. and Etchemendy, J. Turing's World: A Computer-Based Introduction to Computability Theory. Kinko's Academic Courseware Exchange (Santa Barbara, CA 1986).
2
3
4
5
6
 
7
Johnson, S. YACC-yet another compiler-compiler. G5' Technical Report (23, Bell Telephone Laboratories, Murray Hill, NJ, 1975).
8
 
9
Lawrence, A., Badre, A:, and Stasko, J. Empirically Evaluating the Use of Animations to Teach Algorithms Technical Report GIT- G VU- 9~-07 (Georgia Institute of Technology, Atlanta, GA, 1994).
 
10
 
11
 
12
Najork, M. and Brown, M. A library for Visualizing Combinatorial Structures. SRC Research Report (Digital Systems Research Center, Palo Air% CA, September, 1994).
 
13


Collaborative Colleagues:
Sami Khuri: colleagues
Yanti Sugono: colleagues