This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: The maximum line length is 80 characters. Input ends with an end of file. Output------For each test case, a single line. If the input string is an E, the line contains `accept' followed by the number of E, F, and T nodes in the parse tree, in the format indicated by the sample output. If the input Sheet1 Page 3 string is NOT an E, the line merely contains `reject'. Sample Input------ -----x*<x> x<x*x> x<x<x> x<(x<x)> x<x<x>><x> Sample Output------ ------reject accept 1E 3T 3F accept 2E 3T 3F accept 3E 4T 4F reject r File: nastygrammar.txt Author: Bob Walton <email@example.com> Date: Thu Oct 17 10:11:07 EDT 2002 The authors have placed this file in the public domain they make no warranty and accept no liability for this file. RCS Info (may not be true date or author): $Author: walton $ $Date: 2002/10/17 14:26:03 $ $RCSfile: nastygrammar.txt,v $ $Revision: 1.3 $...
View Full Document
This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.
- Spring '11