216 pages = {341--356}, |
216 pages = {341--356}, |
217 series = {LNCS}, |
217 series = {LNCS}, |
218 volume = {6898} |
218 volume = {6898} |
219 } |
219 } |
220 |
220 |
221 |
221 @Article{Okhotin/04a, |
222 |
222 author = "A. Okhotin", |
223 |
223 title = "Boolean {G}rammars", |
|
224 journal = "Inf.~Comput.", |
|
225 pages = "19--48", |
|
226 year = "2004", |
|
227 number = "1", |
|
228 volume = "194", |
|
229 keywords = "context-free grammar, intersection, complement, |
|
230 language equation, parsing, conjunctive grammar, |
|
231 trellis automaton, cellular automaton", |
|
232 abstract = "A new generalization of context-free grammars is |
|
233 introduced: Boolean grammars allow the use of all |
|
234 set-theoretic operations as an integral part of the |
|
235 formalism of rules. Rigorous semantics for these |
|
236 grammars is defined by language equations in a way that |
|
237 allows to generalize some techniques from the theory of |
|
238 context-free grammars, including Chomsky normal form, |
|
239 Cocke-Kasami-Younger cubic-time recognition algorithm |
|
240 and some limited extension of the notion of a parse |
|
241 tree, which together allow to conjecture practical |
|
242 applicability of the new concept. (Copyright 2004 |
|
243 ScienceDirect)", |
|
244 editor = "Albert R. Meyer", |
|
245 publisher = "Elsevier B.V.", |
|
246 address = "Orlando-Amsterdam-Tokyo-Singapore", |
|
247 URL = "http://dx.doi.org/10.1016/j.ic.2004.03.006", |
|
248 cdate = "2004-12-21", |
|
249 mdate = "2005-08-18", |
|
250 } |
|
251 |
|
252 @Article{journals/iandc/KountouriotisNR09, |
|
253 title = "{W}ell-founded {S}emantics for Boolean {G}rammars", |
|
254 author = "V. Kountouriotis and C. Nomikos and P. |
|
255 Rondogiannis", |
|
256 journal = "Inf. Comput", |
|
257 year = "2009", |
|
258 number = "9", |
|
259 volume = "207", |
|
260 bibdate = "2009-09-08", |
|
261 bibsource = "DBLP, |
|
262 http://dblp.uni-trier.de/db/journals/iandc/iandc207.html#KountouriotisNR09", |
|
263 pages = "945--967", |
|
264 URL = "http://dx.doi.org/10.1016/j.ic.2009.05.002", |
|
265 } |
|
266 |
|
267 @Article{journals/corr/abs-1010-5023, |
|
268 title = "Yacc is {D}ead", |
|
269 author = "M. Might and D. Darais", |
|
270 journal = "CoRR", |
|
271 year = "2010", |
|
272 volume = "abs/1010.5023", |
|
273 note = "informal publication", |
|
274 bibdate = "2010-11-03", |
|
275 bibsource = "DBLP, |
|
276 http://dblp.uni-trier.de/db/journals/corr/corr1010.html#abs-1010-5023", |
|
277 URL = "http://arxiv.org/abs/1010.5023", |
|
278 } |
|
279 |
|
280 @InProceedings{Ford04a, |
|
281 author = "B. Ford", |
|
282 title = "Parsing {E}xpression {G}rammars: {A} {R}ecognition-based |
|
283 {S}yntactic {F}oundation", |
|
284 booktitle = "POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT |
|
285 symposium on Principles of programming languages", |
|
286 year = "2004", |
|
287 ISBN = "1-58113-729-X", |
|
288 pages = "111--122", |
|
289 location = "Venice, Italy", |
|
290 doi = "10.1145/964001.964011", |
|
291 URL = "http://pdos.csail.mit.edu/~baford/packrat/popl04/peg-popl04.pdf", |
|
292 publisher = "ACM", |
|
293 address = "New York, NY, USA", |
|
294 keywords = "peg parsing cclit", |
|
295 doi-url = "http://dx.doi.org/10.1145/964001.964011", |
|
296 } |
|
297 |
|
298 @InProceedings{Ford02b, |
|
299 author = "B. Ford", |
|
300 title = "{Packrat Parsing: a Practical Linear-Time Algorithm |
|
301 with Backtracking}", |
|
302 booktitle = "ICFP '02: Proceedings of the seventh ACM SIGPLAN |
|
303 international conference on Functional programming", |
|
304 year = "2002", |
|
305 school = "Massachusetts Institute of Technology", |
|
306 URL = "http://pdos.csail.mit.edu/~baford/packrat/thesis/ |
|
307 http://pdos.csail.mit.edu/~baford/packrat/thesis/thesis.pdf", |
|
308 keywords = "packrat parsing cclit", |
|
309 } |
|
310 |
|
311 @InProceedings{conf/pepm/WarthDM08, |
|
312 title = "{Packrat Parsers Can Support Left Recursion}", |
|
313 author = "A. Warth and J. R. Douglass and T. D. |
|
314 Millstein", |
|
315 bibdate = "2008-04-04", |
|
316 bibsource = "DBLP, |
|
317 http://dblp.uni-trier.de/db/conf/pepm/pepm2008.html#WarthDM08", |
|
318 booktitle = "PEPM", |
|
319 booktitle = "Proceedings of the 2008 {ACM} {SIGPLAN} Symposium on |
|
320 Partial Evaluation and Semantics-based Program |
|
321 Manipulation, {PEPM} 2008, San Francisco, California, |
|
322 {USA}, January 7-8, 2008", |
|
323 publisher = "ACM", |
|
324 year = "2008", |
|
325 editor = "Robert Gl{\"u}ck and Oege de Moor", |
|
326 ISBN = "978-1-59593-977-7", |
|
327 pages = "103--110", |
|
328 URL = "http://doi.acm.org/10.1145/1328408.1328424", |
|
329 } |
|
330 |
|
331 @Article{Earley70, |
|
332 author = "J. Earley", |
|
333 title = "{An Efficient Context-Free Parsing Algorithm}", |
|
334 journal = "Communications of the ACM (CACM)", |
|
335 volume = "13", |
|
336 number = "2", |
|
337 month = feb, |
|
338 year = "1970", |
|
339 keywords = "parallel parsing, syntax analysis, parsing, |
|
340 context-free grammar, compilers, computational |
|
341 complexity, CACM,", |
|
342 } |
|
343 |
|
344 @Article{AycHor02, |
|
345 author = "Aycock and Horspool", |
|
346 title = "{Practical Earley Parsing}", |
|
347 journal = "COMPJ: The Computer Journal", |
|
348 volume = "45", |
|
349 year = "2002", |
|
350 } |