1. Courtesy Costas Busch - RPI1 Positive Properties of Context-Free languages

2. Courtesy Costas Busch - RPI2 Context-free languages are closed under: Union is context free is context-free Union

3. Courtesy Costas Busch - RPI3 Example Union LanguageGrammar

4. Courtesy Costas Busch - RPI4 In general: The grammar of the union has new start variable and additional production For context-free languages with context-free grammars and start variables

5. Courtesy Costas Busch - RPI5 Context-free languages are closed under: Concatenation is context free is context-free Concatenation

6. Courtesy Costas Busch - RPI6 Example Concatenation LanguageGrammar

7. Courtesy Costas Busch - RPI7 In general: The grammar of the concatenation has new start variable and additional production For context-free languages with context-free grammars and start variables

8. Courtesy Costas Busch - RPI8 Context-free languages are closed under: Star-operation is context freeis context-free Star Operation

9. Courtesy Costas Busch - RPI9 Example Language Grammar Star Operation

10. Courtesy Costas Busch - RPI10 In general: The grammar of the star operation has new start variable and additional production For context-free language with context-free grammar and start variable

11. Courtesy Costas Busch - RPI11 Negative Properties of Context-Free Languages

12. Courtesy Costas Busch - RPI12 Context-free languages are not closed under: intersection is context free not necessarily context-free Intersection

13. Courtesy Costas Busch - RPI13 Example Context-free: NOT context-free Intersection

14. Courtesy Costas Busch - RPI14 Context-free languages are not closed under: complement is context freenot necessarily context-free Complement

15. Courtesy Costas Busch - RPI15 NOT context-free Example Context-free: Complement

16. Courtesy Costas Busch - RPI16 Intersection of Context-free languages and Regular Languages

17. Courtesy Costas Busch - RPI17 The intersection of a context-free language and a regular language is a context-free language context free regular context-free

18. Courtesy Costas Busch - RPI18 for NPDA DFA Construct a new NPDA machine that accepts Machine context-free regular simulates in parallel and

19. Courtesy Costas Busch - RPI19 transition NPDADFA transition NPDA

20. Courtesy Costas Busch - RPI20 transition NPDADFA transition NPDA

21. Courtesy Costas Busch - RPI21 initial state NPDADFA Initial state NPDA

22. Courtesy Costas Busch - RPI22 final state final states NPDADFA final states NPDA

23. Courtesy Costas Busch - RPI23 Example: NPDA context-free

24. Courtesy Costas Busch - RPI24 DFA regular

25. Courtesy Costas Busch - RPI25 Automaton for: NPDA context-free

26. Courtesy Costas Busch - RPI26 simulates in parallel and accepts stringif and only if accepts string and accepts string In General:

27. Courtesy Costas Busch - RPI27 Therefore: is NPDA is context-free

28. Courtesy Costas Busch - RPI28 Applications of Regular Closure

29. Courtesy Costas Busch - RPI29 The intersection of a context-free language and a regular language is a context-free language context free regular context-free Regular Closure

30. Courtesy Costas Busch - RPI30 An Application of Regular Closure Prove that: is context-free

31. Courtesy Costas Busch - RPI31 We know: is context-free

32. Courtesy Costas Busch - RPI32 is regular We also know:

33. Courtesy Costas Busch - RPI33 regularcontext-free is context-free (regular closure)

34. Courtesy Costas Busch - RPI34 Another Application of Regular Closure Prove that: is not context-free

35. Courtesy Costas Busch - RPI35 context-freeregularcontext-free If is context-free Then Impossible!!! Therefore, is not context free (regular closure)

36. Courtesy Costas Busch - RPI36 Decidable Properties of Context-Free Languages

37. Courtesy Costas Busch - RPI37 Membership Question: for context-free grammar find if string Membership Algorithms: Parsers Exhaustive search parser CYK parsing algorithm

38. 38

39. Courtesy Costas Busch - RPI39 The CYK Parser

40. Courtesy Costas Busch - RPI40 The CYK Membership Algorithm Input: Grammar in Chomsky Normal Form String Output: find if

41. 41 The CYK Membership Algorithm

42. 42 The CYK Membership Algorithm

43. 43

44. Courtesy Costas Busch - RPI44 The Algorithm Grammar : String : Input example:

45. Courtesy Costas Busch - RPI45

46. Courtesy Costas Busch - RPI46

47. Courtesy Costas Busch - RPI47

48. Courtesy Costas Busch - RPI48

49. Courtesy Costas Busch - RPI49 Therefore: Time Complexity: The CYK algorithm can be easily converted to a parser (bottom up parser) Observation:

50. Courtesy Costas Busch - RPI50 Empty Language Question: for context-free grammar find if Algorithm: 1.Remove useless variables 2.Check if start variable is useless

51. Courtesy Costas Busch - RPI51 Infinite Language Question: for context-free grammar find if is infinite Algorithm: 1. Remove useless variables 2. Remove unit and productions 3. Create dependency graph for variables 4. If there is a loop in the dependency graph then the language is infinite

52. Courtesy Costas Busch - RPI52 Example: Dependency graph Infinite language

53. Courtesy Costas Busch - RPI53

54. 54 Undecidable CFL Problems

55. Courtesy Costas Busch - RPI55 YACC Yet Another Compiler Compiler

56. Courtesy Costas Busch - RPI56 Yacc is a parser generator Input: A Grammar Output: A parser for the grammar Reminder: a parser finds derivations

57. Courtesy Costas Busch - RPI57 Example grammar: The yacc code: expr : '(' expr ')' | expr '+' expr | expr '-' expr | expr '*' expr | expr '/' expr | - expr | INT ; expr -> ( expr ) | expr '+' expr | expr '-' expr | expr '*' expr | expr '/' expr | - expr | INT ;

58. Courtesy Costas Busch - RPI58 Exampe Input: 10 * 3 + 4 Yacc Derivation: expr => expr + expr => expr * expr + expr => 10*3 + 4

59. Courtesy Costas Busch - RPI59 Resolving Ambiguities %left '+', '-' %left '*', '/' %left UMINUS % expr : '(' expr ')' | expr '+' expr | expr '-' expr | expr '*' expr | expr '/' expr | '-' expr %prec UMINUS | INT ;

60. Courtesy Costas Busch - RPI60 Actions %left '+', '-' %left '*', '/' %left UMINUS % expr : '(' expr ')' {$$ = $2;} | expr '+' expr {$$ = $1 + $3;} | expr '-' expr {$$ = $1 - $3;} | expr '*' expr {$$ = $1 * $3;} | expr '/' expr {$$ = $1 / $3;} | '-' expr %prec UMINUS {$$ = -$2;} | INT {$$ = $1;} ;

61. Courtesy Costas Busch - RPI61 A Complete Yacc program %union{ int int_val; } %left '+', '-' %left '*', '/' %left UMINUS %token INT %type expr %start program %

62. Courtesy Costas Busch - RPI62 program : expr {printf("Expr value = %d \n", $1);} | error {printf("YACC: syntax error near line %d \n", linenum); abort();} ; expr : '(' expr ')' {$$ = $2;} | expr '+' expr {$$ = $1 + $3;} | expr '-' expr {$$ = $1 - $3;} | expr '*' expr {$$ = $1 * $3;} | expr '/' expr {$$ = $1 / $3;} | '-' expr %prec UMINUS {$$ = -$2;} | INT {$$ = $1;} ; % #include "lex.yy.c"

63. Courtesy Costas Busch - RPI63 Execution Example 10 + 20*(3 - 4 + 25) Input: Output: Expr value = 490

64. Courtesy Costas Busch - RPI64 The Lex Code %{ int linenum=1; int temp_int; %} % \n {linenum++;} [\t ] /* skip spaces */; \/\/[^\n]* /* ignore comments */; "+" {return '+';} "-" {return '-';} "*" {return '*';} "/" {return '/';} ")" {return ')';} "(" {return '(';}

65. Courtesy Costas Busch - RPI65 [0-9]+ {sscanf(yytext, "%d", &temp_int); yylval.int_val = temp_int; return INT;}. {printf("LEX: unknown input string found in line %d \n", linenum); abort();}

66. Courtesy Costas Busch - RPI66 Compiling: yacc YaccFile lex LexFile cc y.tab.c -ly -ll -o myparser Executable: myparser

67. Courtesy Costas Busch - RPI67 Another Yacc Program %union{ int int_val; } %left '+', '-' %left '*', '/' %left UMINUS %token INT %type expr %start program %

68. Courtesy Costas Busch - RPI68 program : stmt_list | error {printf("YACC: syntax error near line %d \n", linenum); abort();} ; stmt_list : stmt_list stmt | stmt ; stmt : expr ';' {printf("Expr value = %d \n", $1);} ;

69. Courtesy Costas Busch - RPI69 expr : '(' expr ')' {$$ = $2;} | expr '+' expr {$$ = $1 + $3;} | expr '-' expr {$$ = $1 - $3;} | expr '*' expr {$$ = $1 * $3;} | expr '/' expr {$$ = $1 / $3;} | '-' expr %prec UMINUS {$$ = -$2;} | INT {$$ = $1;} ; % #include "lex.yy.c"

70. Courtesy Costas Busch - RPI70 Execution Example 10 + 20*(30 -67) / 4; 34 * 35 - 123 + -001; 17*8/6; Input: Output: Expr value = -175 Expr value = 1066 Expr value = 22

71. Courtesy Costas Busch - RPI71 Lex Code %{ int linenum=1; int temp_int; %} % \n {linenum++;} [\t ] /* skip spaces */; \/\/[^\n]* /* ignore comments */;

72. Courtesy Costas Busch - RPI72 "+" {return '+';} "-" {return '-';} "*" {return '*';} "/" {return '/';} ")" {return ')';} "(" {return '(';} ";" {return ';';} [0-9]+ {sscanf(yytext, "%d", &temp_int); yylval.int_val = temp_int; return INT;}. {printf("LEX: unknown input string found in line %d \n", linenum); abort();}

73. Courtesy Costas Busch - RPI73 Another Yacc Program %union{ int int_val; char *str_val; } %left '+', '-' %left '*', '/' %left UMINUS %token PRINT %token NEWLINE %token STRING %token INT %type expr %start program %

74. Courtesy Costas Busch - RPI74 program : stmt_list | error {printf("YACC: syntax error near line %d \n", linenum); abort();} ; stmt_list : stmt_list stmt | stmt ; stmt : expr ';' {printf("expression found\n");} | PRINT expr ';' {printf("%d", $2);} | PRINT STRING ';' {printf("%s", $2);} | PRINT NEWLINE ';' {printf("\n");} ;

75. Courtesy Costas Busch - RPI75 expr : '(' expr ')' {$$ = $2;} | expr '+' expr {$$ = $1 + $3;} | expr '-' expr {$$ = $1 - $3;} | expr '*' expr {$$ = $1 * $3;} | expr '/' expr {$$ = $1 / $3;} | '-' expr %prec UMINUS {$$ = -$2;} | INT {$$ = $1;} ; % #include "lex.yy.c"

76. Courtesy Costas Busch - RPI76 Execution Example Input: print "The value of expression 123 * 25 is "; print 123 * 25; print newline; 10 + 5 * 8; print "end of program"; print newline; Output: The value of expression 123 * 25 is 3075 expression found end of program

77. Courtesy Costas Busch - RPI77 Lex Code %{ int linenum=1; int temp_int; char temp_str[200]; %} % \n {linenum++;} [\t ] /* skip spaces */; \/\/[^\n]* /* ignore comments */;

78. Courtesy Costas Busch - RPI78 "+" {return '+';} "-" {return '-';} "*" {return '*';} "/" {return '/';} ")" {return ')';} "(" {return '(';} ";" {return ';';} "print" {return PRINT;} "newline" {return NEWLINE;}

79. Courtesy Costas Busch - RPI79 [0-9]+ {sscanf(yytext, "%d", &temp_int); yylval.int_val = temp_int; return INT;} \"[^"\n]*\" {strncpy(temp_str, &(yytext[1]), strlen(yytext)-2); temp_str[strlen(yytext)-2] = (char) 0; yylval.str_val = temp_str; return STRING;}. {printf("LEX: unknown input string found in line %d \n", linenum); abort();}