1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18.

Write a program to check whether a string belongs to grammar or not. Write a program to generate a parse tree. Write a program to check whether a grammar is left recursive and remove left recursion. Write a program to check whether a grammar is operator precedent. WAP to copy the content of one file to another and count the number of comment lines. C/C++ program to count the number of lines, number of words, number of blank spaces and number of character in a file. C/C++ program to recognize strings ‘aaab’, ‘abbb’, ‘ab’, ‘a’, aabb using the grammer (anbn, n>=0). WAP to recognize a valid arithmetic expression that uses operators +, -, * and /. WAP to recognize a valid variable that starts with a letter followed by any number of letters and digits. Program using LEX/YACC to count the number of characters, words, spaces and lines in a given input file. Program using LEX/YACC to count the numbers of comment lines in a given C program. Also eliminate them and copy the resulting program into separate file. Program using LEX/YACC to recognize a valid arithmetic expression and to recognize the identifiers and operators present. Print them separately. Program using LEX/YACC to recognize whether a given sentence is simple or compound. Lex/YACC program to recognize a valid arithmetic expression that uses operators +, -, * and /. Lex/YACC program to evaluate an arithmetic expression involving operators +, -, * and /. Lex/YACC program to recognize strings ‘aaab’, ‘abbb’,‘ab’ and ‘a’ using the grammar (an bn, n>= 0). Write a Lex/YACC program that accepts a regular expression as input and produce its parse tree as output. To generate the symbol table (first OR follow ) for given grammar ??