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.
- 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).Google Scholar
- 2 Bergin, J., Brodlie, K., Goldweber, M., jim~nez-Peris, R., Khuri S., Patifio-Mart~nez, M., McNally, M., Naps, T., Rodger S., and Wilson, J. An Overview of Visualization: its Use and Design. Integrating Technology into Computer Science Education, SIGCSE (28:192- 200, March 1996). Google Scholar
Digital Library
- 3 Bilska, A., Leider, K., Procopiuc, M., Procopiuc, O., Rodger, S., Salemme, and Tsang, E. A Collection of Tools for Making Automata Theory and Formal Languages Come Alive Proc of the SIGCSE Technical Symposium 28 (1:15-19, March 1997). Google Scholar
Digital Library
- 4 Blythe, S., James, M., and Rodger, S. LLparse and LRparse: Visual and interactive Tools for Parsing. Proe of the SIGCSE Technical Symposium 25 (1:208-212, March 1994). Google Scholar
Digital Library
- 5 Boroni, C., Goosey, F., Grinder, M., Rockford, R., and Wissenbach, P. WebLab! A Universal and Interactive Teaching, Learning, and Laboratory Environment for the World Wide Web. Proc of the SIGCSE Technical Symposium 28 (1:199-203, March 1997). Google Scholar
Digital Library
- 6 Hartley, S. Animating Operating Systems Algorithms with XTANGO. Proc of the SIGCSE Technical Symposium 25 (1:344-348, March 1994). Google Scholar
Digital Library
- 7 Johnson, S. YACC-yet another compiler-compiler. G5' Technical Report (23, Bell Telephone Laboratories, Murray Hill, NJ, 1975).Google Scholar
- 8 Khuri, S. and Williams, J. Understanding the Bottom- Up SLR Parser. Pro c of the SIG CSE Technical Symposium 25 (1:339-343, March 1994). Google Scholar
Digital Library
- 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).Google Scholar
- 10 Lewis, H. and Papadimitriou, C. Elements of the Theory of Computation. (Prentice Hall, NY, 1981). Google Scholar
Digital Library
- 11 Loudea, K. Compiler Construction: Principles and Practice. (PWS, 1997). Google Scholar
Digital Library
- 12 Najork, M. and Brown, M. A library for Visualizing Combinatorial Structures. SRC Research Report (Digital Systems Research Center, Palo Air% CA, September, 1994).Google Scholar
- 13 Stasko, J. TANGO: A Framework and System for Algorithm Animation. IEEE Computer (23:27-39, September 1990). Google Scholar
Digital Library
Index Terms
Animating parsing algorithms
Recommendations
Animating parsing algorithms
SIGCSE '98: Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science educationThe 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 ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Evaluating GLR parsing algorithms
The fourth workshop on language descriptions, tools, and applications (LDTA'04)We describe the behaviour of three variants of GLR parsing: (i) Farshi's original Correction to Tomita's non-general algorithm; (ii) the Right Nulled GLR algorithm which provides a more efficient generalisation of Tomita and (iii) the Binary Right ...






Comments