Question

In class, we talked about how you could encode a DFA as a string, so that a Turing machine could read in that string M, along with another input string w, and determine whether the DFA M accepts w or not. Now, let's think about how we could do this for grammars. In particular, explain how you would encode a grammar as a string g so that a Turing machine could easily take g and an input string w and determine whether w could be produced by the grammar. Explain how your solution works in general and give the specific string g it would produce from the following grammar: S rightarrow aS\bS\bT T rightarrow abU\bU U rightarrow a\bT

Answer 1

import java.util.Scanner;

/* category BSTNode */
category BSTNode
builder */
public BSTNode()

/* creator */
public BSTNode(int n)

/* perform to line left node */
public void setLeft(BSTNode n)

/* perform to line right node */
public void setRight(BSTNode n)

/* perform to induce left node */
public BSTNode getLeft()
come left;
}
/* perform to induce right node */
public BSTNode getRight()
come right;
}
/* perform to line knowledge to node */
public void setData(int d)

/* perform to induce knowledge from node */
public int getData()
come data;
}   
}

/* category BST */
class BST
non-public BSTNode root;

/* creator */
public BST()

/* perform to ascertain if tree is empty */
public Boolean isEmpty()
come root == null;
}
/* Functions to insert knowledge */
public void insert(int data)

/* perform to insert knowledge recursively */
non-public BSTNode insert(BSTNode node, int data)

come node;
}
/* Functions to delete knowledge */
public void delete(int k)
rval)
r = r.getRight();
else
{
found = true;
break;
" id="tip_70">
found = search(r, val);
}
come found;
}
/* perform for inorder traversal */
public void inorder()

non-public void inorder(BSTNode r)

non-public void preorder(BSTNode r)

non-public void postorder(BSTNode r)
making object of BST */
BST bst = new BST();
System.out.println("Binary Search Tree Test\n");
char ch;
/* Perform tree operations */
do