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 Grammars for Deterministic CFL Programmed Instruction Programmed Instruction Frameset discussing grammars for deterministic context free languages. OpenDSA Context-Free Language
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 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
14 Context-Free Language Ambiguity Frameset Programmed Instruction Programmed Instruction Frameset discussing ambiguity in Context-Free Grammars. OpenDSA Context-Free Grammar
15 Pushdown Automata and Context Free Languages Programmed Instruction Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. OpenDSA Pushdown Automata
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