Regular-expression derivatives re-examined

Journal of Functional Programming

Volumn 19, Issue 2, 2009, Pages 173-190

  Owens, Scott ^a   Reppy, John ^b   Turon, Aaron ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN OPERATIONS; COMPUTER SCIENTISTS; FINITE-STATE; LARGE CHARACTER SET; REGULAR EXPRESSIONS; STATE MACHINE; UNICODES;

CHARACTER SETS; PATTERN MATCHING;

DATA HANDLING;

EID: 68149157031     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796808007090     Document Type: Article

References (18)

1. Aho, A. V., Hopcroft, J. E. & Ullman, J. D. (1974) he Design and Analysis of Computer Algorithms. Reading, MA: Addison Wesley.
2. Aho, A. V., Sethi, R. & Ullman, J. D. (1986) Compilers: Principles, Techniques, and Tools. Reading, MA: Addison Wesley.
3. Aho, A. V. & Ullman, J. D. (1972) The Theory of Parsing, Translation, and Compiling. Vol. 1. Englewood Cliffs, NJ: Prentice Hall.
4. Appel, A. W. (1998) Modern Compiler Implementation in ML. Cambridge: Cambridge University Press.
5. Appel, A. W., Mattson, J. S. & Tarditi, D. R. (1994Oct.) A Lexical Analyzer Generator for Standard ML. Available at: http://smlnj.org/doc/ML- Lex/manual.html.
6. Baxter, I., Pidgeon, C., & Mehlich, M. (2004) DMS: Program transformations for practical scalable software evolution. In International Conference on Software Engineering.
7. Berry, G. (1999) The Esterel v5 Language Primer Version 5.21 Release 2.0. Available at: ftp://ftp-sop.inria.fr/meije/esterel/papers/primer.pdf.
8. Berry, G., & Sethi, R. (1986) From regular expressions to deterministic automata. Theoret. Comp. Sci. Dec., 48(1) 117-126.
9. Brzozowski, J. A. (1964) Derivatives of regular expressions. J. ACM 11(4), 481-494.
10. ∼joe/ sgml/validate.html. (Accessed 24 November 2008).
11. Findler, R. B., Clements, J., Flanagan, C., Flatt, M., Krishnamurthi, S., Steckler, P., & Felleisen, M. (2002) DrScheme: A programming environment for Scheme. J. Funct. Prog. 12(2), 159-182.
12. Fisher, C. N., & LeBlanc, Jr., R. J. (1988) Crafting a Compiler. Menlo Park, CA: Benjamin/ Cummings.
13. McNaughton, R., & Yamada, H. (1960) Regular expressions and state graphs for automata. IEEE Trans. Elec. Comp. 9, 39-47.
14. Rabin, M. O., & Scott, D. (1959) Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114-125.
15. Schmidt, Martin. (2002) Design and Implementation of a Validating XML Parser in Haskell. Master's thesis, Computer Science Department, University of Applied Sciences Wedel.
16. Sen, K., & Roşu, G. (2003) Generating optimal monitors for extended regular expressions. In Proceedings of Runtime Verification (RV'03). Boulder, Colorado. Electronic Notes in Theoretical Computer Science, vol. 89, no. 2, pp. 226-245. Elsevier Science.
17. Thompson, K. (1968) Regular expression search algorithm. Comm. ACM 11(6), 419-422.
18. Unicode Consortium. (2003) The Unicode Standard, Version 4. Reading, MA: Addison-Wesley Professional.