Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 1 of 721 Quit Programming Languages http://www.cse.iitd.ac.in/ s̃ak/courses/pl/2020-21/index.html S. Arun-Kumar & Subodh Sharma Department...

I have an online exam to be given on Standard Machine learning


Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 1 of 721 Quit Programming Languages http://www.cse.iitd.ac.in/ s̃ak/courses/pl/2020-21/index.html S. Arun-Kumar & Subodh Sharma Department of Computer Science and Engineering I. I. T. Delhi, Hauz Khas, New Delhi 110 016. May 4, 2021 http://www.cse.iitd.ac.in/~sak/courses/pl/2020-21/index.html Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 2 of 721 Quit Contents 1 The Programming Languages Overview 3 2 Introduction to Compiling 25 3 Scanning or Lexical Analysis 45 3.1 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 3.2 Nondeterministic Finite Automata (NFA) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 3.3 Deterministic Finite Automata (DFA) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 4 Parsing or Syntax Analysis 135 4.1 Grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135 4.2 Context-Free Grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142 Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 3 of 721 Quit 4.3 Ambiguity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156 4.4 The “dangling else” problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176 4.5 Specification of Syntax: Extended Backus-Naur Form . . . . . . . . . . . . . . . . . . . . . . 187 4.6 The WHILE Programming Language: Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . 195 4.7 Parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213 4.8 Recursive Descent Parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218 4.9 Shift-Reduce Parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235 4.10 Bottom-Up Parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 4.11 Simple LR Parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317 5 Attributes & Semantic Analysis 355 5.1 Context-sensitive analysis and Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 4 of 721 Quit 6 Static Scope Rules 367 7 Runtime Structure 385 8 Abstract Syntax 396 9 Syntax-Directed Translation 412 9.1 Synthesized Attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 9.2 Inherited Attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445 10 Symbol Table 466 11 Intermediate Representation 475 12 The Pure Untyped Lambda Calculus: Basics 500 Home Page JJ J I II PL May 4, 2021 Go Back Full Screen Close 5 of 721 Quit 12.1 Motivation for λ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 500 12.2 The λ-notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 505 13 Notions of Reduction 537 14 Confluence Definitions 552 14.1 Why confluence? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 558 14.2 Confluence: Church-Rosser . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 567 14.3 The Church-Rosser Property . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 575 15 An Applied Lambda-Calculus 584 15.1 FL with recursion .