- Grammar for Ruby

You can install Ruby on your own machine (http://www.ruby-lang.org/en/downloads/)

or try the html-embedded ruby interpreter to demonstrate Ruby in your presentation:

http://tryruby.org/. There are also tutorials on this site. - CFG for theorem generation
- ***********
**Taken************Faith ContextFree.js & Algorithm Ink: Making Art with Javascript**

context-free art is its basis: John Edgar Park **A discussion of Turing's Imitation GameKirkpatrick and Klingner*************************Taken***********AigerimParsing expression grammars (PEGS)**Parsing in a Compiler using CFG for the programming language, with the CFG in the correct form.****Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars; (1994); Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjvlander, Rebecca C. Underwood, David Haussler; Proc. of the Asilomar Conference on Combinatorial Pattern Matching***********************Taken**********Mai PhamComputing with DNA by Leonard Adleman; Scientific American; August 1998 (not on-line); method that has high probability of finding a solution to the Hamiltonian path problem using DNA**Read Section 3.6.2 and 3.6.3 of Lewis and Papadimitriou textbook on Top-Down and Bottom-Up Parsing (of context-free grammars).*************************Taken*********** Janet Molecular Query Language which is a context-free grammar for substructure matching*************Taken**********Aliyah The Stochastic Revolution in Art and Science by Graham Coulter-Smith**Sketch of the Analytical Engine with Ada Augusta, Countess of Lovelace notes**

as well as

a mechanical description of the analytical engine.****************Taken**********Gillian Riggs and Lindsey GregorGenerating Rock Guitar Solos with a Context-Free Grammar***********************Taken*********** R.B.RA context-free grammar for the foxtrot**Regular expressions in Perl - either use a textbook from 104 or 209, or do a web search. You'll have to know/learn a little Perl and then describe how it uses regular expressions for pattern matching. Show examples.**********************Taken*****************Brian MartinLight Parsing as Finite-State Filtering; using transducers (finite-state machines with output. Used for language processing used in information retrieval and information extraction.***************Taken************CatherineRecognizing Multitasked Activities Using Stochastic Context-Free Grammars (Black Jack domain)**Download and demonstrate JFLAP. JFLAP is a package of graphical tools which can be used as an aid in learning the basic concepts of Formal Languages and Automata Theory.*************************Taken*********** Janet For the musically inclined, take a look at Bol Processor Grammars; grammars for Indian Tabla drumming.

Articles:

1998; Migrating Musical Concepts -- an Overview of the Bol Processor. Computer Music Journal, 22, 2, pp.56-64.

And.... Sound samples, etc are here**Write a turing machine program for an interesting problem.****-->The Enigma Machine**

Paper 1

Paper 2

Enigma photos**Chapter 23 of Cohen textbook: Turing Machine Languages.****Chapter 24 of Cohen textbook: the Chomsky Hierarchy.****Chapter 25 of Cohen textbook: Computers.****--> For the mathematically brave - Quantum Computing grammars**- Quantum Automata and Quantum Grammars by Moore and Crutchfield

Click here for paper

- Quantum Automata and Quantum Grammars by Moore and Crutchfield
*******************Taken************Laura ShupekG-pictures: Elements of a Probabilistic Pictorial Grammar (rules are in picture form. Terminals and Nonterminals are embedded in the picture.) Studies of Mondrian.*********************Taken***********Amy Tayloelojban, a constructed, standardized, human language 40 years old.

What is lojban.org's Annotated machine grammar?**Redstart Systems Human-Machine Grammar What are the rules and words?****What operations are performed on context-free grammars to ready them for use as language models for compilers?*************************Taken***********Sarah

Finite State Machines in games: