Formal languages
Citations from CiteSeer ist
abstract syntax tree - ResearchIndex document query
BNF and EBNF: What are they and how do they work? by Lars Marius Garshol.
BNF and EBNF: What are they and how do they work?
ISO/IEC 14977 : 1996(E) cam iso
The Naming of Parts " by John E. Simpson
XML.com: The Naming of Parts
Citations from CiteSeer ist
extended backus naur form - ResearchIndex document query
"LsystemComposition" . Page at Pawfal ("poor artists working for a living") about using L-systems and genetic algorithms to generate music.
Pawfal :: LsystemComposition
L-systems gallery – a tribute to Fractint oblivion
F r a c t I n t @ o b l i v i o n
An evolutionary L-systems generator (anyos*) staff
WSC 10 Virtual Exhibition pfeiffer the genetic snow flake
Lyndyhop: another simple L-systems generator (Windows & Mac)
LYNDYHOP - exploring Lindenmayer systems
A simple L-systems generator (Windows) content
generation5 - L-Systems Explorer
L-Systems in Architecture portfolio
Lindenmayer Systems in Architecture
''Fractint'' home page spanky triumf www
Fractint Homepage
Fractint L-System True Fractals spanky triumf www
FRACTINT L-systems True Fractals
Algorithmic Botany at the University of Calgary
Algorithmic Botany: Home
Made by http://www.froola.com.
"An introduction to Lindenmayer systems", by Gabriela Ochoa . Brief description of L-systems and how the strings they generate can be interpreted by computer.
An Introduction to Lindenmayer Systems
Good Wright's article on L-systems math dynamics
L-systems
Dictionary of Algorithms and Data Structures: longest common subsequence nist dads html
longest common subsequence
Myhill–Nerode Theorem explained in greater detail [pdf]
The Packrat Parsing and Parsing Expression Grammars Page mit packrat
Packrat Parsing and
Parsing Expression Grammars
PEG Board at the Institute for End User Computing, promoting the use of PEGs instead of regular expressions.
PEG Board
Parsing Expression Grammars: A Recognition-Based Syntactic Foundation (PDF)
froola - forget the rest.
History of QED bell labs who qed
History of QED
Stanford Encyclopedia of Philosophy entry on quotation plato stanford entries quotation
Quotation
Complexity Zoo: R
Complexity Zoo - Qwiki
Complexity Zoo: RE
Complexity Zoo - Qwiki
Expresso A free Regular Expression integrated development environment for developing, testing, and coding .NET regular expressions. Also includes a built-in tutorial and regular expression library.
Expresso Regular Expression Development Tool
Crypter JavaScript-based RegExp tool
grawity :: Projects :: Crypter
ZVON Regular Expression Reference Brief reference with one paragraph and one example per regex token.
Regular Expressions Reference
The 30 Minute Regex Tutorial Learn how to use regular expressions in 30 minutes.
The 30 Minute Regex Tutorial - The Code Project - .NET
Regenechsen Beginners regular expression tutorial with exercises.
Regenechsen :: Ideas come true | Regular Expressions TB (engl.)
Next page
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia articles :
Abstract syntax tree , Backus-Naur form , Extended Backus-Naur form , Longest-common subsequence problem , L-system , Myhill–Nerode theorem , Parsing expression grammar , QED (text editor) , Quasi-quotation , Recursive language , Recursively enumerable language , Regular expression , .
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Froola link list about "Formal languages".