September 15

September 15 - CSCI 2670 Introduction to Theory of...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing September 15, 2005
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Agenda Yesterday Introduce context-free grammars Today No quiz! Quiz postponed until Monday Regular expressions, pumping lemma, CFG’s Build CFG’s
Background image of page 2
Context-free grammar definition A context-free grammar is a 4-tuple (V, Σ ,R,S),  where 1. V is a finite set called the  variables , 1. Σ  is a finite set, disjoint from V, called the  terminals , 1. R is a finite set of  rules , with each rule being a  variable and a string of variables and terminals, and 2.  V is the  start variable .
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
More definitions If u, v, and w are strings of variables and  terminals, and A   w is a rule of the grammar, we  say uAv  yields  uwv Denoted uAv   uwv If a sequence of rules leads from u to v – i.e., u    u 1    u 2    …   v, we denote this  *  v   (I can’t do the actual notation in powerpoint – the * should  be over the double bars) The  language  of the grammar is  {w    Σ *  | s  *  w}
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 18

September 15 - CSCI 2670 Introduction to Theory of...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online