Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Parsing an Expression | Algorithm Visualization, User Supplied Data | Algorithm Visualization for generating the parse tree of a user-supplied mathematical expression. Demonstrates that the associated grammar enforces the correct... | OpenDSA | Parse Tree |
| 2 | Parse Tree Example: Enforcing Order of Operations | Algorithm Visualization | Slideshow visualizing a parse tree from a grammar that enforces the correct order of operations. | OpenDSA | Parse Tree |
| 3 | Parse Tree Example for a Math Expression | Algorithm Visualization | Slideshow visualizing generation of a parse tree for a simple math expression. | OpenDSA | Parse Tree |
| 4 | Ambiguous Parse Tree Example for a Math Expression | Algorithm Visualization | Slideshow visualizing how generation of a parse tree from a grammar might be ambiguous. | OpenDSA | Parse Tree |
| 5 | Ambiguous Parse Tree Example for a Math Expression: 2 | Algorithm Visualization | Slideshow visualizing a second example of how generation of a parse tree from a grammar might be ambiguous. | OpenDSA | Parse Tree |
| 6 | Determining Number of Parse Tree Nodes Exercise: Alternate | Calculation Exercise, Battery | User determines the number of nodes in a parse tree generated by a given string on a given grammar. Alternative... | OpenDSA | Context-Free Grammar, Parse Tree |
| 7 | Determining Whether a Given String is Derivable from Given Grammar Exercise: Alternate | Calculation Exercise, Battery | A collection of self-practice questions where users determine which strings can or cannot be derived from a given grammar: Alternate. | OpenDSA | Context-Free Grammar, Parse Tree |
| 8 | Determining Number of Parse Tree Nodes Exercise | Calculation Exercise | User determines the number of nodes in a parse tree generated by a given string on a given grammar. | OpenDSA | Context-Free Grammar, Parse Tree |
| 9 | CFG Ambiguity 1 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Parse Tree |
| 10 | Determining Whether a Given String is Derivable from Given Grammar Exercise | Question | A question where users determine which strings can or cannot be derived from a given grammar. | OpenDSA | Context-Free Grammar, Parse Tree |
| 11 | Unambiguous CFG Parse Tree Example | Algorithm Visualization | Visualization for the parse tree generated for a mathematical expression from a non-ambiguouse CFG. | OpenDSA | Context-Free Language, Parse Tree |
| 12 | Lambda Calculus: How to Build a Parse Tree | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing building a parse tree for lambda calculus expressions. | OpenDSA | Lambda Calculus |