CSci 3501 Algorithms and Computability - Lab 11.

Due Tuesday, November 15 at 11:59pm

What to submit and when:

Lab assignment

Work in pairs

Lab overview and goals

The goal of the lab is to get practice with context-free grammars, push-down automata, and the pumping lemma for context-free languages.

Context-free grammars and pushdown automata (20 points)

Please refer to the corresponding sections of the JFLAP tutorial, namely Entering grammars (just pressing "enter" on the right hand side enters an empty string), Brute Force Parser for constructing parse trees, and Constructing a push-down automaton. If Brute Force Parser doesn't work on your grammar, contsruct your parse tree manually using User Control Parser.

Your tasks are as follows:

  1. A context free grammar for the language of strings a^n b^m, where n >= m
  2. A context free grammar for the language of strings a^k followed by any number of b followed by c^k
  3. A context-free grammar for odd-length strings of alternating zeros and ones. It can start with either zero or one.
  4. A context-free grammar for a language of 0, 1, true, false, operations <, >, == , a ternary conditional operator ?:, and parentheses. The order of precedence is as follows: parentheses have the highest precedence, then the comparison operations, and then the conditional operator.

    The conditional operator is defined as following:

    e1? e2 : e3
    evalautes e1, and if it is true then it evaluates and returns e2, otherwise it evaluates and returns e3. For example:
     0 < 1? 0 : 1
    would be interpreted as
    
    (0 < 1) ? 0 : 1
    
    which becomes
    
    true ? 0 : 1 
    
    after the condition is evaluated, which would in turn result in 0.

    The comparison operators <, >, == are left-associative, i.e.

    0 == 1 == false
    should be interpreted as
    (0 == 1) == false
    which evaluates to
    false == false
    which is true.

    The conditional is right-associative:

     0 > 1 ? 0 : 0 == 0 ? 1 : 0
    is interpreted as
    (0 > 1) ? 0 : ((0 == 0) ? 1 : 0) 
    then evaluated as
    false ? 0 : ((0 == 0) ? 1 : 0)
    then as
    false ? 0 : (true ? 1 : 0)
    then as
    false ? 0 : 1
    which will return 1.

    Test your grammar on all of the test cases above and two more cases that check for precedence, associativity, and parentheses. Submit jpg files for the parse trees.

    Note that language designers don't always get the associativity right.

    Important: your grammar must enforce correct precedence and associativity for all operations. Your write-up for this problem should briefly explain how this is done.

  5. A pushdown automaton for the language of strings a^k followed by any number of b followed by c^k (do not convert your grammar from the previous question into an automaton or vice versa)
  6. A pushdown automaton for the language of strings a^n b^m where n <= m.

Convert context-free grammars to pushdown automata (3 points)

Use the option Convert CFG to PDA (LL) for this problem. In a plain-text file explain what rules were added to the PDA and why.

  1. Convert the grammar for the language of palindromes to a PDA. The alphabet is 0,1. Submit the resulting PDA.

What to submit


CSci 3501 course web site.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.