Parsing computer languages with an automaton compiled from a single regular expression

Authors:
Adrian D. Thurston
Affiliations:
Software Technology Laboratory, Queen’s University, Kingston, Canada
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 0
Cited 4

High-performance regular expression scanning on the Cell/B.E. processor

Proceedings of the 23rd international conference on Supercomputing
CroMo --Morphological Analysis for Standard Croatian and its Synchronic and Diachronic Dialects and Variants

Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Multicore and cloud-based solutions for genomic variant analysis

Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Improving the performance of message parsers for embedded systems

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

When a programmer is faced with the task of producing a parser for a context-free language there are many tools to choose from. We find that programmers avoid such tools when making parsers for simpler, domain-specific computer languages, such as file formats, communication protocols and end-user inputs. Since these languages often meet the criteria for regular languages, the extra run-time effort required for supporting the recursive nature of context-free languages is wasted.