slide1
Download
Skip this Video
Download Presentation
Erik Jonsson School of Engineering and Computer Science

Loading in 2 Seconds...

play fullscreen
1 / 105

Erik Jonsson School of Engineering and Computer Science - PowerPoint PPT Presentation


  • 85 Views
  • Uploaded on

Erik Jonsson School of Engineering and Computer Science. CS 4384 – 0 01. Automata Theory. http://www.utdallas.edu/~pervin. Tuesday: Context-Free Languages Chapter Three – Review All. Thursday 4-03-14. FEARLESS Engineering.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Erik Jonsson School of Engineering and Computer Science' - jermaine-alford


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide1
Erik Jonsson School of Engineering

and Computer Science

CS 4384– 001

Automata Theory

http://www.utdallas.edu/~pervin

Tuesday: Context-Free Languages

Chapter Three – Review All

Thursday4-03-14

FEARLESS Engineering

slide2
A search of Albert Einstein's archived manuscripts last year turned up a draft of an early unpublished paper by the famed physicist that concluded, mistakenly, that new matter, such as stars and galaxies, would appear to fill the expanding universe. Einstein was attempting to make sense of Edwin Hubble's observation that the universe was expanding, but he made a mathematical error. When he discovered his mistake, he set aside the paper, which is now in a digital archive of his papers at the Hebrew University in Jerusalem. Waterford Institute of Technology physicist Cormac O'Raifeartaigh and colleagues found the paper while scouring the archive.
o ther simplifications

Other Simplifications

Useful variables and productions

Left-recursion

pushdown automata

Pushdown Automata

Many similar definitions

pumping lemma

PUMPING LEMMA

Context-Free

slide37
Read and push a’s onto the stack; read b’s and match them against the stack until empty; read any additional b’s and push them onto the stack; read and match c’s with stack exactly.
slide38
For each a read, non-deterministically push ONE or TWO a’s on the stack; then match b’s read exactly with stack.
ambiguity

Ambiguity

Dangling ELSE Problem

end of file empty stack
End of File (EOF):

UNIX Control-D (ASCII 04)

Windows Control-Z (ASCII 26)

Java’s Buffered Reader Null (ASCII 0)

Empty Stack ($), (Zo)

End of File; Empty Stack
transducer
An automaton whose output response is limited to a simple “yes” or “no” is called an accepter. Presented with an input string, an accepter either accepts (recognizes) the string or rejects it.
  • A more general automaton, capable of producing strings of symbols as output, is called a transducer.
Transducer

Linz, P. 26 (Pushdown Transducer)

parsing1
Parsing

LL(k) Grammars

practice

PRACTICE

CFG+PDA+CFL+PL

slide102
(Nothing “useless”)

Example 3.4.1 on P. 105ff M&S

ad