You can help the community by contributing reviews and ratings to the catalog.
Here is a detailed description for the catalog entry structure.
Virginia Tech LL Parsing
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
Pavan Konanki; Gokulnath Kannan; Ajith Sowndararajan |
||||
Institution |
Virginia Tech |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates LL Parsing algorithm on some canned datasets. |
||||
Evaluation |
Given the complexity of the topic, this is a good visualization. For the given data sets, the user is taken through the major steps, showing the table contents for each term in the grammar as it is processed. This AV cannot stand on its own, as it does not give a tutorial on the LL parsing algorithm or its context. But it could be very helpful to students who have read about the algorithm and need to reinforce the textual description with a dynamic demonstration. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-06-30 |
||||
Last Visited |
2008-06-30 |
||||
Last Updated |
2008-05-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
Trakla - Infix to Postfix
Recommendation |
Recommended |
||||
Link |
http://www.cs.hut.fi/Research/TRAKLA2/exercises/InfixToPostfixExpressions.html |
||||
Delivery Method |
Java Application |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Ville Karavirta; Ari Korhonen; Lauri Malmi; Kimmo Stålnacke |
||||
Institution |
Helsinki University of Technology |
||||
Project |
|||||
Works |
Yes |
||||
Description |
User works through an exercise demonstrating proficiency at converting from infix to postfix notation. |
||||
Evaluation |
Excellent exercise. The one flaw with this AV is that the algorithm is presented as a "cookbook". It could use just a little bit of background explanation and intuition, so that the user isn't just playing the role of a computer but is instead actually demonstrating his or her proficiency. |
||||
Canned Data; Predictions |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-25 |
||||
Last Visited |
2008-07-25 |
||||
Last Updated |
2006-01-25 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
JHAVÉ - Stack-based Parsing
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Web Start |
||||
License |
|||||
Language |
English |
||||
Author |
Tom Naps |
||||
Institution |
University of Wisconsin - Oshkosh |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Visualization of expression parsing using a stack. |
||||
Evaluation |
The AV is set up as a series of "slides" in one pane, and pseudocode in the adjacent pane. As the user steps through the "slides", the associated pseudocode is highlighted. Occasional questions pop up for the user to answer. This AV has no explanation of what is going on. So it cannot stand on its own, it needs to be used in the context of a lesson on the material. |
||||
Step Control; Questions; Canned Data |
|||||
Lecture Aid; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
Clicking on the link above will take you to a login page for Jhave. If you do not want to create an account at jhave.org, use anonymous@anonymous.com as your user name and anonymous as your password when you are asked to login. You will then be taken to the Jhave page for this AV. Some Jhave AVs include a tutorial on how the AV itself or the underlying algorithm works. At the bottom are links to the AV (you can run it with a built-in quiz system on or off). The first time you try to run any Jhave exercise, you will have to download the Jhave webstart application. This should happen automatically when you click the link. (You might need to install Java WebStart if it is not on your machine.) Once you download the Jhave application, the AV should start automatically. You can then step through the AV by repeatedly clicking the right arrow button. Occasionally, you will be given a multiple-choice or short-answer question to answer. |
|||||
First Visited |
2008-07-08 |
||||
Last Visited |
2008-07-10 |
||||
Last Updated |
2008-07-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
OLLI - LALR Parser
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
German |
||||
Author |
Thomas App |
||||
Institution |
University of Oldenburg |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A complete tutorial for LALR parsing with a series of embedded applets. Users must interact with the applets to move the action forward. |
||||
Evaluation |
The presentation is fairly detailed. This tutorial can stand alone as an introduction to binomial heaps. |
||||
Step Control; Canned Data; Questions |
|||||
Lecture Aid; Lab Exercise; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
Clicking on the link above will take you to a "table of contents" for the tutorial. You can click on sections, or you can follow the forward/backward arrows to go through the tutorial. |
|||||
First Visited |
2010-02-06 |
||||
Last Visited |
2010-02-06 |
||||
Last Updated |
2001-02-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |