diff -r 999fce5f9d34 -r 114064363ef0 Journal/document/root.bib
--- a/Journal/document/root.bib	Sun Sep 04 00:21:41 2011 +0000
+++ b/Journal/document/root.bib	Sun Sep 04 07:28:48 2011 +0000
@@ -218,6 +218,133 @@
   volume    = {6898}
 }
 
+@Article{Okhotin/04a,
+  author =	"A. Okhotin",
+  title =	"Boolean {G}rammars",
+  journal =	"Inf.~Comput.",
+  pages =	"19--48",
+  year = 	"2004",
+  number =	"1",
+  volume =	"194",
+  keywords =	"context-free grammar, intersection, complement,
+		 language equation, parsing, conjunctive grammar,
+		 trellis automaton, cellular automaton",
+  abstract =	"A new generalization of context-free grammars is
+		 introduced: Boolean grammars allow the use of all
+		 set-theoretic operations as an integral part of the
+		 formalism of rules. Rigorous semantics for these
+		 grammars is defined by language equations in a way that
+		 allows to generalize some techniques from the theory of
+		 context-free grammars, including Chomsky normal form,
+		 Cocke-Kasami-Younger cubic-time recognition algorithm
+		 and some limited extension of the notion of a parse
+		 tree, which together allow to conjecture practical
+		 applicability of the new concept. (Copyright 2004
+		 ScienceDirect)",
+  editor =	"Albert R. Meyer",
+  publisher =	"Elsevier B.V.",
+  address =	"Orlando-Amsterdam-Tokyo-Singapore",
+  URL =  	"http://dx.doi.org/10.1016/j.ic.2004.03.006",
+  cdate =	"2004-12-21",
+  mdate =	"2005-08-18",
+}
 
+@Article{journals/iandc/KountouriotisNR09,
+  title =	"{W}ell-founded {S}emantics for Boolean {G}rammars",
+  author =	"V. Kountouriotis and C. Nomikos and P.
+		 Rondogiannis",
+  journal =	"Inf. Comput",
+  year = 	"2009",
+  number =	"9",
+  volume =	"207",
+  bibdate =	"2009-09-08",
+  bibsource =	"DBLP,
+		 http://dblp.uni-trier.de/db/journals/iandc/iandc207.html#KountouriotisNR09",
+  pages =	"945--967",
+  URL =  	"http://dx.doi.org/10.1016/j.ic.2009.05.002",
+}
+
+@Article{journals/corr/abs-1010-5023,
+  title =	"Yacc is {D}ead",
+  author =	"M. Might and D. Darais",
+  journal =	"CoRR",
+  year = 	"2010",
+  volume =	"abs/1010.5023",
+  note = 	"informal publication",
+  bibdate =	"2010-11-03",
+  bibsource =	"DBLP,
+		 http://dblp.uni-trier.de/db/journals/corr/corr1010.html#abs-1010-5023",
+  URL =  	"http://arxiv.org/abs/1010.5023",
+}
 
- 
\ No newline at end of file
+@InProceedings{Ford04a,
+  author =	"B. Ford",
+  title =	"Parsing {E}xpression {G}rammars: {A} {R}ecognition-based
+		 {S}yntactic {F}oundation",
+  booktitle =	"POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT
+		 symposium on Principles of programming languages",
+  year = 	"2004",
+  ISBN = 	"1-58113-729-X",
+  pages =	"111--122",
+  location =	"Venice, Italy",
+  doi =  	"10.1145/964001.964011",
+  URL =  	"http://pdos.csail.mit.edu/~baford/packrat/popl04/peg-popl04.pdf",
+  publisher =	"ACM",
+  address =	"New York, NY, USA",
+  keywords =	"peg parsing cclit",
+  doi-url =	"http://dx.doi.org/10.1145/964001.964011",
+}
+
+@InProceedings{Ford02b,
+  author =	"B. Ford",
+  title =	"{Packrat Parsing: a Practical Linear-Time Algorithm
+		 with Backtracking}",
+  booktitle =	"ICFP '02: Proceedings of the seventh ACM SIGPLAN
+		 international conference on Functional programming",
+  year = 	"2002",
+  school =	"Massachusetts Institute of Technology",
+  URL =  	"http://pdos.csail.mit.edu/~baford/packrat/thesis/
+		 http://pdos.csail.mit.edu/~baford/packrat/thesis/thesis.pdf",
+  keywords =	"packrat parsing cclit",
+}
+
+@InProceedings{conf/pepm/WarthDM08,
+  title =	"{Packrat Parsers Can Support Left Recursion}",
+  author =	"A. Warth and J. R. Douglass and T. D.
+		 Millstein",
+  bibdate =	"2008-04-04",
+  bibsource =	"DBLP,
+		 http://dblp.uni-trier.de/db/conf/pepm/pepm2008.html#WarthDM08",
+  booktitle =	"PEPM",
+  booktitle =	"Proceedings of the 2008 {ACM} {SIGPLAN} Symposium on
+		 Partial Evaluation and Semantics-based Program
+		 Manipulation, {PEPM} 2008, San Francisco, California,
+		 {USA}, January 7-8, 2008",
+  publisher =	"ACM",
+  year = 	"2008",
+  editor =	"Robert Gl{\"u}ck and Oege de Moor",
+  ISBN = 	"978-1-59593-977-7",
+  pages =	"103--110",
+  URL =  	"http://doi.acm.org/10.1145/1328408.1328424",
+}
+
+@Article{Earley70,
+  author =	"J. Earley",
+  title =	"{An Efficient Context-Free Parsing Algorithm}",
+  journal =	"Communications of the ACM (CACM)",
+  volume =	"13",
+  number =	"2",
+  month =	feb,
+  year = 	"1970",
+  keywords =	"parallel parsing, syntax analysis, parsing,
+		 context-free grammar, compilers, computational
+		 complexity, CACM,",
+}
+
+@Article{AycHor02,
+  author =	"Aycock and Horspool",
+  title =	"{Practical Earley Parsing}",
+  journal =	"COMPJ: The Computer Journal",
+  volume =	"45",
+  year = 	"2002",
+}
\ No newline at end of file