250 pages = {341--356}, |
250 pages = {341--356}, |
251 series = {LNCS}, |
251 series = {LNCS}, |
252 volume = {6898} |
252 volume = {6898} |
253 } |
253 } |
254 |
254 |
255 @Article{Okhotin/04a, |
255 |
256 author = "A. Okhotin", |
256 |
257 title = "Boolean {G}rammars", |
257 @Article{Okhotin04, |
258 journal = "Inf.~Comput.", |
258 author = "A.~Okhotin", |
|
259 title = "{B}oolean {G}rammars", |
|
260 journal = "Information and Computation", |
259 pages = "19--48", |
261 pages = "19--48", |
260 year = "2004", |
262 year = "2004", |
261 number = "1", |
263 number = "1", |
262 volume = "194", |
264 volume = "194" |
263 keywords = "context-free grammar, intersection, complement, |
265 } |
264 language equation, parsing, conjunctive grammar, |
266 |
265 trellis automaton, cellular automaton", |
267 @Article{KountouriotisNR09, |
266 abstract = "A new generalization of context-free grammars is |
268 title = "{W}ell-founded {S}emantics for {B}oolean {G}rammars", |
267 introduced: Boolean grammars allow the use of all |
269 author = "V.~Kountouriotis and C.~Nomikos and P.~Rondogiannis", |
268 set-theoretic operations as an integral part of the |
270 journal = "Information and Computation", |
269 formalism of rules. Rigorous semantics for these |
271 year = 2009, |
270 grammars is defined by language equations in a way that |
272 number = 9, |
271 allows to generalize some techniques from the theory of |
273 volume = 207, |
272 context-free grammars, including Chomsky normal form, |
274 pages = {945--967} |
273 Cocke-Kasami-Younger cubic-time recognition algorithm |
275 } |
274 and some limited extension of the notion of a parse |
276 |
275 tree, which together allow to conjecture practical |
277 |
276 applicability of the new concept. (Copyright 2004 |
278 @article{Leroy09, |
277 ScienceDirect)", |
279 author = {X.~Leroy}, |
278 editor = "Albert R. Meyer", |
280 title = {{F}ormal {V}erification of a {R}ealistic {C}ompiler}, |
279 publisher = "Elsevier B.V.", |
281 journal = {Communications of the ACM}, |
280 address = "Orlando-Amsterdam-Tokyo-Singapore", |
282 year = 2009, |
281 URL = "http://dx.doi.org/10.1016/j.ic.2004.03.006", |
283 volume = 52, |
282 cdate = "2004-12-21", |
284 number = 7, |
283 mdate = "2005-08-18", |
285 pages = {107--115} |
284 } |
286 } |
285 |
287 |
286 @Article{journals/iandc/KountouriotisNR09, |
288 |
287 title = "{W}ell-founded {S}emantics for Boolean {G}rammars", |
289 @Unpublished{Might11, |
288 author = "V. Kountouriotis and C. Nomikos and P. |
290 title = "{Y}acc is {D}ead", |
289 Rondogiannis", |
291 author = "M.~Might and D.~Darais", |
290 journal = "Inf. Comput", |
292 note = "To appear in {\it Proc.~of the 16th ACM International Conference on |
291 year = "2009", |
293 Functional Programming (ICFP)}", |
292 number = "9", |
294 year = 2011 |
293 volume = "207", |
295 } |
294 bibdate = "2009-09-08", |
296 |
295 bibsource = "DBLP, |
297 @InProceedings{Ford04, |
296 http://dblp.uni-trier.de/db/journals/iandc/iandc207.html#KountouriotisNR09", |
298 author = "B.~Ford", |
297 pages = "945--967", |
299 title = "{P}arsing {E}xpression {G}rammars: {A} {R}ecognition-{B}ased |
298 URL = "http://dx.doi.org/10.1016/j.ic.2009.05.002", |
|
299 } |
|
300 |
|
301 @Article{journals/corr/abs-1010-5023, |
|
302 title = "Yacc is {D}ead", |
|
303 author = "M. Might and D. Darais", |
|
304 journal = "CoRR", |
|
305 year = "2010", |
|
306 volume = "abs/1010.5023", |
|
307 note = "informal publication", |
|
308 bibdate = "2010-11-03", |
|
309 bibsource = "DBLP, |
|
310 http://dblp.uni-trier.de/db/journals/corr/corr1010.html#abs-1010-5023", |
|
311 URL = "http://arxiv.org/abs/1010.5023", |
|
312 } |
|
313 |
|
314 @InProceedings{Ford04a, |
|
315 author = "B. Ford", |
|
316 title = "Parsing {E}xpression {G}rammars: {A} {R}ecognition-based |
|
317 {S}yntactic {F}oundation", |
300 {S}yntactic {F}oundation", |
318 booktitle = "POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT |
301 booktitle = "Proc.~of the 31st ACM Symposium on Principles of Programming Languages (POPL)", |
319 symposium on Principles of programming languages", |
302 year = 2004, |
320 year = "2004", |
303 pages = "111--122" |
321 ISBN = "1-58113-729-X", |
304 } |
322 pages = "111--122", |
305 |
323 location = "Venice, Italy", |
306 @InProceedings{Ford02, |
324 doi = "10.1145/964001.964011", |
307 author = "B.~Ford", |
325 URL = "http://pdos.csail.mit.edu/~baford/packrat/popl04/peg-popl04.pdf", |
308 title = "{P}ackrat {P}arsing: : {S}imple, {P}owerful, {L}azy, {L}inear {T}ime, |
326 publisher = "ACM", |
309 ({F}unctional {P}earl)", |
327 address = "New York, NY, USA", |
310 booktitle = "Proc.~of the 7th ACM International Conference on Functional Programming (ICFP)", |
328 keywords = "peg parsing cclit", |
|
329 doi-url = "http://dx.doi.org/10.1145/964001.964011", |
|
330 } |
|
331 |
|
332 @InProceedings{Ford02b, |
|
333 author = "B. Ford", |
|
334 title = "{Packrat Parsing: a Practical Linear-Time Algorithm |
|
335 with Backtracking}", |
|
336 booktitle = "ICFP '02: Proceedings of the seventh ACM SIGPLAN |
|
337 international conference on Functional programming", |
|
338 year = "2002", |
311 year = "2002", |
339 school = "Massachusetts Institute of Technology", |
312 pages = {36--47} |
340 URL = "http://pdos.csail.mit.edu/~baford/packrat/thesis/ |
313 |
341 http://pdos.csail.mit.edu/~baford/packrat/thesis/thesis.pdf", |
314 } |
342 keywords = "packrat parsing cclit", |
315 |
343 } |
316 @InProceedings{WarthDM08, |
344 |
317 title = "{{P}ackrat {P}arsers {C}an {S}upport {L}eft {R}ecursion}", |
345 @InProceedings{conf/pepm/WarthDM08, |
318 author = "A.~Warth and J.~R.~Douglass and T.~D.~Millstein", |
346 title = "{Packrat Parsers Can Support Left Recursion}", |
319 booktitle = "Proc. of the {ACM} Symposium on |
347 author = "A. Warth and J. R. Douglass and T. D. |
|
348 Millstein", |
|
349 bibdate = "2008-04-04", |
|
350 bibsource = "DBLP, |
|
351 http://dblp.uni-trier.de/db/conf/pepm/pepm2008.html#WarthDM08", |
|
352 booktitle = "PEPM", |
|
353 booktitle = "Proceedings of the 2008 {ACM} {SIGPLAN} Symposium on |
|
354 Partial Evaluation and Semantics-based Program |
320 Partial Evaluation and Semantics-based Program |
355 Manipulation, {PEPM} 2008, San Francisco, California, |
321 Manipulation (PEPM)", |
356 {USA}, January 7-8, 2008", |
|
357 publisher = "ACM", |
|
358 year = "2008", |
322 year = "2008", |
359 editor = "Robert Gl{\"u}ck and Oege de Moor", |
323 pages = "103--110" |
360 ISBN = "978-1-59593-977-7", |
|
361 pages = "103--110", |
|
362 URL = "http://doi.acm.org/10.1145/1328408.1328424", |
|
363 } |
324 } |
364 |
325 |
365 @Article{Earley70, |
326 @Article{Earley70, |
366 author = "J. Earley", |
327 author = "J. Earley", |
367 title = "{An Efficient Context-Free Parsing Algorithm}", |
328 title = "{An Efficient Context-Free Parsing Algorithm}", |
368 journal = "Communications of the ACM (CACM)", |
329 journal = "Communications of the ACM", |
369 volume = "13", |
330 volume = "13", |
370 number = "2", |
331 number = "2", |
371 month = feb, |
332 pages = {94--102}, |
372 year = "1970", |
333 year = "1970" |
373 keywords = "parallel parsing, syntax analysis, parsing, |
|
374 context-free grammar, compilers, computational |
|
375 complexity, CACM,", |
|
376 } |
334 } |
377 |
335 |
378 @Article{AycHor02, |
336 @Article{AycHor02, |
379 author = "Aycock and Horspool", |
337 author = "J.~Aycock and R.~N.~Horspool", |
380 title = "{Practical Earley Parsing}", |
338 title = "{{P}ractical {E}arley {P}arsing}", |
381 journal = "COMPJ: The Computer Journal", |
339 journal = "The Computer Journal", |
382 volume = "45", |
340 volume = "45", |
|
341 number = "6", |
|
342 pages = "620--630", |
383 year = "2002", |
343 year = "2002", |
384 } |
344 } |
385 |
345 |