CS241 Study Guide - Final Guide: Opcode, Parse Tree, Catcat
Document Summary
Topics: regular languages and expressions, context-free languages and grammars, wlpp programming, lexical analysis (scanning, ll and lr parsing, context-sensitive analysis, extending wlpp, the big picture, memory management, pre-midterm stu . Any problem labelled exercise may be brie y discussed in the review session, but it will not be solved. You should look at these problems yourself and make sure you understand how to do them. Not in the language: caat, catcat, cat, attacat, ccatt: exercise: write a regular expression for the language of words over the alphabet = {c, d, k, u} that. T in one or more of these three categories: Simply the string duck repeated one or more times. Words that contain at least one u but do not contain k. Words that contain two us immediately following each d. Example words: duckduckduck, cuddud, duuuckduu, dududcc, kduu, . Not in the language: duckdu, kcud, duuduck, kuddud, duckduckduckuck.
