##################################################################
# This is an example of just about the simplest reasonable input.
# It shows two months of a MW course.  NOTE: The "virtual Monday"
# on 2 FEB is NOT actually in the 2006 Calendar!
##################################################################

DateRange:
  8 1 2006   # This is a comment, you can escape # with \ if needed
  22 2 2006
:endDateRange:

Holidays(blocking):
  MLK Day 16 1 2006
  Presidents Day 20 2 2006
:endHolidays(blocking):

Holidays(non-blocking):
  Add Deadline 20 1 2006
  Prereg Begins 23 1 2006
:endHolidays(non-blocking):

Virtual_Days:
  Monday 2 2 2006
:endVirtual_Days:

#############################################################
# NOTE: Each non-blank line is a topic!  If you've got a really
#       looooong line, use line continuation (see below).
#############################################################
Topics: Numbered_Topics "Class $: " MW
  Intro: course, alphabet, language.
  Introducing finite automata and JFLAP.
  Complement, instersect machines with diagrams
  Set Theory Basics
  A formal definition of a DFA

  ## Note the use of line continuation below
  Functions and Formal Algorithms <br/>\
      <span class="red">(<a href="quiz/Q01/Quiz.html">Quiz 1</a>\
       Due 9/6)</span>

  More formal algorithms
  More formal algorithms

* Exam # The leading * makes this unnumbered

  Configurations and a formal def of accept/reject
  Finishing configurations and started NDFAs
  Constructing NDFAs &amp; formal definition of NDFAs
  More algorithms for NDFAs <br/><span class="red">\
      (<a href="quiz/Q02/Quiz.html">Quiz 2</a> Due 9/19)</span>
  Reviewing Algorithms &amp; Notation
  Reprising Proof &amp; Algorithm
  Converting NDFAs to DFAs
  Converting NDFAs to DFAs II
  Converting NDFAs to DFAs III
:endTopics: