335 Review Game 1. Teams Zack, Jamie, Alex D, Marshall Colby, Riley, Alex Z, Fritz Lawrence, Paul, Gavan, Ben Catharine, Matt, Andrew, Alexis Spencer,

Slides:



Advertisements
Similar presentations
4b Lexical analysis Finite Automata
Advertisements

Lecture 9,10 Theory of AUTOMATA
Regular Expressions and DFAs COP 3402 (Summer 2014)
CSCI 160 Midterm Review Rasanjalee DM.
Finite Automata CPSC 388 Ellen Walker Hiram College.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2005.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 3 School of Innovation, Design and Engineering Mälardalen University 2012.
331 Final Fall Details 3:30-5:30 Monday, December 16 ITE 229 (this room!) Comprehensive with more emphasis on material since the midterm Look at.
Finite Automata and Non Determinism
Courtesy Costas Busch - RPI1 Non Deterministic Automata.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.
1 The scanning process Goal: automate the process Idea: –Start with an RE –Build a DFA How? –We can build a non-deterministic finite automaton (Thompson's.
1 CSC 3130: Automata theory and formal languages Tutorial 4 KN Hung Office: SHB 1026 Department of Computer Science & Engineering.
Homework #2 Solutions.
Topics Automata Theory Grammars and Languages Complexities
Automating Construction of Lexers. Example in javacc TOKEN: { ( | | "_")* > | ( )* > | } SKIP: { " " | "\n" | "\t" } --> get automatically generated code.
1.Defs. a)Finite Automaton: A Finite Automaton ( FA ) has finite set of ‘states’ ( Q={q 0, q 1, q 2, ….. ) and its ‘control’ moves from state to state.
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with exactly one.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Lexical Analysis The Scanner Scanner 1. Introduction A scanner, sometimes called a lexical analyzer A scanner : – gets a stream of characters (source.
Regular Languages A language is regular over  if it can be built from ;, {  }, and { a } for every a 2 , using operators union ( [ ), concatenation.
Exam 2 Review. Teams Dan C, Z, Hugh, Zane, Alexis Mark, Jamie, Ryan, Alex H, Andrew Katie, Emily, Riley, Rohan, Alex D Dawn, Patrick, Jacapo, Catharine,
CPSC 388 – Compiler Design and Construction Scanners – Finite State Automata.
331 Final Spring Details 6-8 pm next Monday Comprehensive with more emphasis on material since the midterm Study example finals and midterm exams.
CSCI 2670 Introduction to Theory of Computing August 24, 2005.
CSC 335 Review Game Exam 2. Teams Andrew, Marshall, Riley, Z Emily, Paul, Dawn, Lisa Gavan, Catharine, David, Alex D Michelle, Matt, Rohan, Jamie Ben,
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
Automating Construction of Lexers. Example in javacc TOKEN: { ( | | "_")* > | ( )* > | } SKIP: { " " | "\n" | "\t" } --> get automatically generated code.
2. Scanning College of Information and Communications Prof. Heejin Park.
4b 4b Lexical analysis Finite Automata. Finite Automata (FA) FA also called Finite State Machine (FSM) –Abstract model of a computing entity. –Decides.
TRANSITION DIAGRAM BASED LEXICAL ANALYZER and FINITE AUTOMATA Class date : 12 August, 2013 Prepared by : Karimgailiu R Panmei Roll no. : 11CS10020 GROUP.
Lexical Analysis: Finite Automata CS 471 September 5, 2007.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 3 Mälardalen University 2010.
331 Final Fall Details 3:30-5:30 Friday December 17 th LH4 Comprehensive with more emphasis on material since the midterm Study example finals and.
CSC 331 Review Game 1. Teams Katie, Mark, Alex Z, Dan B., Zane Dan C, Alex D, Dawn, Marshall, Zack Colby, Benjamin, Lisa, Riley, Andrew Catharine, Ryan,
CMSC 330: Organization of Programming Languages Finite Automata NFAs  DFAs.
Overview of Previous Lesson(s) Over View  Symbol tables are data structures that are used by compilers to hold information about source-program constructs.
Finite Automata Chapter 1. Automatic Door Example Top View.
Lecture 2 Overview Topics What I forgot from last lecture Proof techniques continued Alphabets, strings, languages Automata June 2, 2015 CSCE 355 Foundations.
Chapter 2 Scanning. Dr.Manal AbdulazizCS463 Ch22 The Scanning Process Lexical analysis or scanning has the task of reading the source program as a file.
Transparency No. 2-1 Formal Language and Automata Theory Homework 2.
using Deterministic Finite Automata & Nondeterministic Finite Automata
CS 154 Formal Languages and Computability February 9 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.
Nondeterministic Finite Automata (NFAs). Reminder: Deterministic Finite Automata (DFA) q For every state q in Q and every character  in , one and only.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.
CS 404Ahmed Ezzat 1 CS 404 Introduction to Compiler Design Lecture 1 Ahmed Ezzat.
Deterministic Finite Automata Nondeterministic Finite Automata.
CS412/413 Introduction to Compilers Radu Rugina Lecture 3: Finite Automata 25 Jan 02.
WELCOME TO A JOURNEY TO CS419 Dr. Hussien Sharaf Dr. Mohammad Nassef Department of Computer Science, Faculty of Computers and Information, Cairo University.
Costas Busch - LSU1 Deterministic Finite Automata And Regular Languages.
WELCOME TO A JOURNEY TO CS419 Dr. Hussien Sharaf Dr. Mohammad Nassef Department of Computer Science, Faculty of Computers and Information, Cairo University.
Lecture Three: Finite Automata Finite Automata, Lecture 3, slide 1 Amjad Ali.
Lexical analysis Finite Automata
Non Deterministic Automata
CSE 105 theory of computation
Theory of Computation Lecture # 9-10.
An Introduction to Finite Automata
Chapter 2 FINITE AUTOMATA.
REGULAR LANGUAGES AND REGULAR GRAMMARS
Deterministic Finite Automata And Regular Languages Prof. Busch - LSU.
Non-Deterministic Finite Automata
CSE322 Definition and description of finite Automata
Non Deterministic Automata
Finite Automata.
4b Lexical analysis Finite Automata
4b Lexical analysis Finite Automata
Instructor: Aaron Roth
Chapter 1 Regular Language
Non Deterministic Automata
Lexical Analysis Uses formalism of Regular Languages
Presentation transcript:

335 Review Game 1

Teams Zack, Jamie, Alex D, Marshall Colby, Riley, Alex Z, Fritz Lawrence, Paul, Gavan, Ben Catharine, Matt, Andrew, Alexis Spencer, Jerry, Emily, Michelle Dawn, David, Malecki, Casey John, Tim, Lisa, Z, Rohan Zane, Hugh, Dillon, Patrick

Individual round

1. Describe Java in terms of: – Generation? – Paradigm?

2. Describe Java in terms of: - Declarative/Procedural? - Compiled/ Interpreted?

3. Describe Python in terms of: – Generation? – Paradigm?

4. Describe Python in terms of: - Declarative/Procedural? - Compiled/ Interpreted?

5. What is reflection?

6. What does it mean to say a variable is hidden?

7. What kind of data structure is the symbol table?

8. What does it mean for a language to be statically scoped?

9. What does the java keyword “static” refer to?

10. Give a pro and a con of a language offering reflection.

11. What is forward-referencing?

12. What makes a language regular?

13. What are the 2 ways to make an automaton non-deterministic?

14. Give a pro and a con for a language being very high level.

15. What does it print? s = “Hello” print s[:2]

16. What is the difference? x = [] y = {}

17. If L1 = {ab n, n> 0} and L2 = {a n b 2n, n>0} what is L1 intersect L2?

18. If L1 = {ab n, n> 0} what is L1 * ?

19. What does it do? def mystery(lst): sec = 0 for x in lst: sec += len(x) return sec

20. NFA or DFA? Give 2 strings NOT in the language.

21. Name the kind of problem where Java would be a better choice of language than Python

22. For this code, tell what generation it is and what paradigm it belongs to. parent(X,Y) if mom(X,Y) or dad(X,Y). grandParent(X,Y) if parent(X,Z) and parent(Z,Y). mom(sue, sally).

23. Give an example of a program that cannot be written without reflection.

24. In Java reflection, what is a field?

25. What is a scripting language?

26. For this code, tell what generation it is and whether it is declarative or procedural. ADD(R1, 3) MUL(R1, 5) STO(R1,2032)

27. What is a stream in Java 8?

28. What is a lambda function?

29. What are the 2 main ways to obtain a Class object in Java?

30. Is this deterministic?

31. How many strings are in this language?

32. What strings are in this language?

All-Play

Write the automata Draw an automaton for the language of all strings on {a,b}* that start with aa but do NOT contain the substring bb.

Write a Python method that takes a list of strings called lst and makes a dictionary where the keys are the lengths of the words and the values are the words themselves lst = [“yeah”, “this”, “rocks”] {4:[“yeah”, “this”], 5:[“rocks”]}