PPT-Exercises on Grammars

1 Consider the following grammar S gt L a L gt L S S Is this grammar ambiguous Is this grammar LL1 Compute the First and Follow sets for the new grammar Construct . Ehsan. . Khoddammohammadi. Recent Advances in Parsing Technology. WS 2012/13. Saarland University. 1. Outline. Definition and motivation behind . u. nsupervised . g. rammar learning. Non-parametric Bayesian statistics. by. Ravi. chandhran . Madhavan. , EPFL. Mikael Mayër, EPFL. Sumit Gulwani, MSR. Viktor Kuncak, EPFL. Overview of the Talk. Proving equivalence of two CFGs. Generation. of words belonging to a CFG. Finding counter-examples for equivalence . The Chomsky hierarchy of grammars . Context-free grammars describe languages that regular grammars can’t . Unrestricted. Context-sensitive. Context-free. Regular. Slide after Durbin, . et al. ., 1998. A . shorted version from. :. Anastasia . Berdnikova. &. Denis . Miretskiy. ‘Colourless green ideas sleep furiously’.. Chomsky constructed finite formal machines – ‘. grammars. ’.. ‘Does the language contain this sentence?’ (intractable) . A Practical Guide. by . Dick Grune and. Ceriel. J. H. Jacobs. 1. Book in slide format. F. antastic book: . Parsing Techniques. I went through chapters 1 and 2 of the book and created slides of them.. CDT301 – . Compiler. . Theory. , Spring 2011. Teacher. : Linus Källberg. 2. Outline. Introduction to parsing. Specifying language syntax using CFGs. Ambiguous grammars. Introduction to . parsing. David Kauchak. CS30 – Spring 2016. Grammars. What is a grammar?. Grammars. Language view: . A grammar is a set of structural rules that govern the composition of sentences, phrases and words.. Computational view:. Ravichandhran. . Madhavan. , . EPFL. Joint work with. Mikael . Mayër. , EPFL. Sumit. . Gulwani. , MSR. Viktor . Kuncak. , EPFL. Overview. u. nit -> . pkg. ? . i. mp* type*. field -> method | . Cradle. -to-Cradle . Design. . Douglas H. Fisher . Vanderbilt University. douglas.h.fisher@. vanderbilt.edu. Mary Lou Maher . University of Maryland, College Park. marylou.maher@. gmail.com. Presentation to the . David Kauchak. CS30 – Spring 2016. Grammars. What is a grammar?. Grammars. Language view: . A grammar is a set of structural rules that govern the composition of sentences, phrases and words.. Computational view:. General grammars. Context Sensitive grammars. Context Free grammars. Linear . grammars. Grammar types. There are 4 types of grammars according to the types of rules:. Each type recognizes a set of languages. . Attributes can have any type, but often they are trees. Example:. context-free grammar rule: . A ::= B C. attribute grammar rules:. A ::= B C . { . Plus($1. , $. 2. ) . }. or, . e.g.. A ::= B. Learning . Objectives. At the conclusion of the chapter, the student will be able to:. Define the three basic concepts in the theory of computation: automaton, formal language, and grammar.. Solve exercises using mathematical techniques and notation learned in previous courses.. Cognitive Psychology. Notes 11. Where We Are. We. ’. re continuing with higher cognition. We still have:. Language—Structure. Language—Meaning. Reasoning/Decision making. Human factors. Plan of Attack.