Tasks
If you happen to wander across this page, don't despair if it looks a little confusing. This is really a page internal to the Webworks project team members.
General
 |
Have a common "remote control" interface for the functions of the animations
The interface should show and hide buttons depending on whether a certain animation uses those functions | ||||||||||||||||||||||||
|
Include a "description window" as part of animation windows. This should include scroll bars | ||||||||||||||||||||||||
|
Have application and applet versions of each animation.
| ||||||||||||||||||||||||
|
An authors' tool is needed for each module that allows an author to create examples and exercises for embedding in a hypertextbook. |
Finite State Automata
|
Reversing |
|
Not allowing symbols in the input string that are not in the alphabet for the automaton |
| epsilon should not automatically be included in the alphabet for an FSA. (May 14, 2001) |
|
Ensuring that all aspects of an automata are in the XML: State set, alphabet, transitions, start state, set of accepts states (which could be empty). Also, the description tags for each state, the text commentary to accompany transitions, and the voice commentary for the same should somehow be incorproated. |
|
Have description tags for each state that are opened, say, by hovering over a state with the pointer |
|
An editor that allows the input of a tag for a state should be included in the animation. |
|
The editor should also be available in the animation framework to allow for inputting both text and voice commentary data. |
The Pascal Program Animator
|
Editor |
|
Compiler |
The Compiler Project
The Hypertextbook
Rocky |
Michael |
Brad |
| Chapter 1: complete for the black diamond track | Finite state automaton should show labels on transitions | Get regular expression exercises and comparator applets working. |
| Chapter 1: complete the blue square track. | Finite state automaton comparison module should accept any two fsa's in any form (nondeterministic, deterministic) | Get regular expression application and applet ready for hypertextbook. |
| Chapter 1: complete the green circle track. | Exercises should allow for specification of such properties of the fsa being built by a student as: must be deterministic, may be non-deterministic, must be minimal state, and submitted fsa's should be checked against the specifications and feedback given. | Get regular grammar exercises and comparator applets working. |
| Animation for converting a nondeterministic finite state automaton into a deterministic finite state automaton. | Get regular grammar application and applet ready for hypertextbook. | |
| Animation for converting a deterministic finite state automaton into its minimal form. | Create animation applet for regular expression to fsa conversion and vice versa | |
| Animating the pumping lemma for regular languages. | Create animation applet for regular grammar to fsa conversion and vise versa. | |
Problems
Netscape 6.01 does not handle some of the features of FrontPage properly.
Netscape 6.01 is flaky under Windows 2000 on the notebook when not on the network.