Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Context-Free Language Derivations Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. | OpenDSA | Context-Free Language |
| 2 | Context-Free Language Introduction Frameset | Programmed Instruction | Programmed Instruction Frameset introducing Context-Free Languages and their formal definition. | OpenDSA | Context-Free Language |
| 3 | Context-Free Language Derivation Trees Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. | OpenDSA | Context-Free Language |
| 4 | Context-Free Language Membership Problem Frameset | Programmed Instruction | Programmed Instruction Frameset discussing how to recognize if a given string is derivable from a given Context-Free Grammar. | OpenDSA | Context-Free Language |
| 5 | Context-Free Language Derivation Trees Example | Algorithm Visualization | Visualization of a derviation tree from a given context-free grammar. | OpenDSA | Context-Free Language |
| 6 | Context-Free Language Ambiguity Frameset | Programmed Instruction | Programmed Instruction Frameset discussing ambiguity in Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 7 | Closure Properties for Context-Free Languages | Programmed Instruction | Programmed Instruction slideshow explaining the concept and giving examples of closure properties for Context-Free Languages. | OpenDSA | Context-Free Language, Closure Property |
| 8 | Context-Free Language Pumping Lemma Example 1 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... | OpenDSA | Context-Free Language, Pumping Lemma |
| 9 | Context-Free Language Pumping Lemma Example 2 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... | OpenDSA | Context-Free Language, Pumping Lemma |
| 10 | Context-Free Language Pumping Lemma Example 3 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^j b^k... | OpenDSA | Context-Free Language, Pumping Lemma |
| 11 | Context-Free Language Pumping Lemma Example 4 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: w, reverse... | OpenDSA | Context-Free Language, Pumping Lemma |
| 12 | Pumping Lemma for Context-Free Languages | Programmed Instruction | Programmed Instruction slideshow introducing a pumping lemma for Context-Free Languages. | OpenDSA | Context-Free Language, Pumping Lemma |
| 13 | Pushdown Automata and Context Free Languages | Programmed Instruction | Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. | OpenDSA | Pushdown Automata |
| 14 | Grammars for Deterministic CFL | Programmed Instruction | Programmed Instruction Frameset discussing grammars for deterministic context free languages. | OpenDSA | Context-Free Language |
| 15 | 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 |
| 16 | Language from CFG Exercise | Question | Users select a language description for a given CFG. | OpenDSA | Context-Free Grammar |
| 17 | Language from CFG Exercise: Alternate | Question, Battery | A collection of self-practice questions where users select a language description for a given CFG. Alternate version. | OpenDSA | Context-Free Grammar |
| 18 | CFG Exercise: a^mb^ia^n, i=m+n | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ia^n, i=m+n. | OpenDSA | Context-Free Grammar |
| 19 | CFG Exercise: a^mb^ic^n, i less than 3 | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ic^n, i < 3. | OpenDSA | Context-Free Grammar |
| 20 | CFG Exercise: Odd length | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^nb^m where m - n is positive, odd. | OpenDSA | Context-Free Grammar |
| 21 | CFG Exercise: a's and b's are equal | Grammar Construction Exercise | User creates a CFG that generates strings in the language where the number of a's and b's is equal. | OpenDSA | Context-Free Grammar |
| 22 | Context-Free Grammar Transformation: Chomsky Normal Form Frameset | Programmed Instruction | Programmed Instruction Frameset discussing Chomsky Normal Form for Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 23 | Context-Free Grammar Transformation: Greibach Normal Form Frameset | Programmed Instruction | Programmed Instruction Frameset discussing Greibach Normal Form for Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 24 | Context-Free Grammar Transformation: Remove Lambda Productions Frameset | Programmed Instruction | Programmed Instruction Frameset discussing removing lambda productions from Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 25 | Context-Free Grammar Transformation: Remove Unit Productions Frameset | Programmed Instruction | Programmed Instruction Frameset discussing removing unit productions from Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 26 | Context-Free Grammar Transformation: Useless Productions Frameset | Programmed Instruction | Programmed Instruction Frameset discussing removing useless productions from Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 27 | Context-Free Grammar Transformation Introduction Frameset | Programmed Instruction | Programmed Instruction Frameset discussing reasons for transforming Context-Free Grammars to simpler versions. | OpenDSA | Context-Free Grammar |
| 28 | CFG Transformation Exercise 1 | Grammar Construction Exercise | User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 1. | OpenDSA | Context-Free Grammar |
| 29 | CFG Transformation Exercise 2 | Grammar Construction Exercise | User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 2. | OpenDSA | Context-Free Grammar |
| 30 | CFG Transformation: Chomsky Normal Form | Grammar Construction Exercise | User creates an equivalent CFG in Chomsky Normal Form. | OpenDSA | Context-Free Grammar |
| 31 | DFA Exercise: Length a Multiple of 3 with No aab | Automata Construction Exercise | User creates a DFA that recognizes strings with length a multiple of 3 and containing no instance of aab. | OpenDSA | Context-Free Grammar |
| 32 | CFG Associativity Exercise: Alternate | Question, Battery | A collection of self-practice questions where users evaluate a mathematical expression and deterimine if the grammar enforces correct associativity. Alternate... | OpenDSA | Context-Free Grammar, Ambiguity |
| 33 | CFG Determining Ambiguity Exercise: Alternate | Question, Battery | A collection of self-practice questions where users determine whether a given CFG is ambiguous or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 34 | CFG Expression Evaluation Exercise: Alternate | Question, Battery | A collection of self-practice questions where users evaluate a mathematical expression under the definition of a given CFG. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 35 | Extended BNF Exercise: Alternate | Question, Battery | A collection of self-practice questions where users select extended BNF statements matching a normal set of BNF statements. Alternate version. | OpenDSA | Context-Free Grammar |
| 36 | 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 |
| 37 | CFG Ambiguity 1 Exercise: Alternate | Question, Battery | A collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 38 | CFG Ambiguity 2 Exercise: Alternate | Question, Battery | A second collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 39 | CFG Ambiguity 3 Exercise: Alternate | Question, Battery | A third collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 40 | CFG Precedence and Associativity Exercise: Alternate | Question, Battery | A collection of self-practice questions where users evaluate a mathematical expression and deterimine if the grammar enforces correct precedence and... | OpenDSA | Context-Free Grammar, Ambiguity |
| 41 | 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 |
| 42 | CFG Associativity Exercise | Question | A question where users evaluate a mathematical expression and deterimine if the grammar enforces correct associativity. | OpenDSA | Context-Free Grammar, Ambiguity |
| 43 | CFG Determining Ambiguity Exercise | Question | A question where users determine whether a given CFG is ambiguous or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 44 | CFG Expression Evaluation Exercise | Calculation Exercise, Battery | A collection of self-practice questions where users evaluate a mathematical expression under the definition of a given CFG. | OpenDSA | Context-Free Grammar, Ambiguity |
| 45 | Extended BNF Exercise | Question | A question where users select extended BNF statements matching a normal set of BNF statements. | OpenDSA | Context-Free Grammar |
| 46 | 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 |
| 47 | 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 |
| 48 | CFG Ambiguity 2 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 49 | CFG Ambiguity 3 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 50 | CFG Precedence and Associativity Exercise | Question | A question where users evaluate a mathematical expression and deterimine if the grammar enforces correct precedence and associativity. | OpenDSA | Context-Free Grammar, Ambiguity |
| 51 | 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 |
| 52 | Review of the Concept of Closure Properties | Programmed Instruction | Programmed Instruction Frameset reviewing the concept of closure properties, in the context of regular languages. | OpenDSA | Regular Language, Closure Property |
| 53 | Bills statistics | Write a program that combines the content of two files and saves it to a third file. The first file... | PCEX |