Skip to main content
SpringerLink
Log in

Greedy Regular Expression Matching

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3142))

Included in the following conference series:

Abstract

This paper studies the problem of matching sequences against regular expressions in order to produce structured values.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benzaken, V., Castagna, G., Frisch, A.: CDuce: An XML-centric general-purpose language. In: ICFP 2003 (2003)

    Google Scholar 

  2. Boag, S., Chamberlin, D., Fernandez, M., Florescu, D., Robie, J., Siméon, J., Stefanescu, M.: XQuery 1.0: An XML Query Language. W3C Working Draft (May 2003), http://www.w3.org/TR/xquery/

  3. Dub, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Informatica 37(2), 121–144 (2000)

    Article  MathSciNet  Google Scholar 

  4. ECMA. CLI Partition I - Architecture (2002), http://msdn.microsoft.com/net/ecma/

  5. Frisch, A.: Regular tree language recognition with static information. In: International Conference on Theoretical Computer Science (2004)

    Google Scholar 

  6. Gapayev, V., Pierce, B.C.: Regular object types. In: Proceedings of the 10th workshop FOOL (2003)

    Google Scholar 

  7. Harper, R.: Proof-directed debugging. Journal of Functional Programming 9(4), 463–469 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hosoya, H.: Regular Expression Types for XML. PhD thesis, The University of Tokyo (2001)

    Google Scholar 

  9. Hosoya, H.: Regular expressions pattern matching: a simpler design (February 2003) (unpublished manuscript)

    Google Scholar 

  10. Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. In: The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2001)

    Google Scholar 

  11. Hosoya, H., Pierce, B.C.: XDuce: A typed XML processing language. ACM Transactions on Internet Technology 3(2), 117–148 (2003)

    Article  Google Scholar 

  12. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: ICFP 2000. SIGPLAN Notices, vol. 35(9) (2000)

    Google Scholar 

  13. Kearns, S.M.: Extending regular expressions with context operators and parse extraction. Software - practice and experience 21(8), 787–804 (1991)

    Article  Google Scholar 

  14. Laurikari, V.: Efficient submatch addressing for regular expressions. Master’s thesis, Helsinki University of Technology (2001)

    Google Scholar 

  15. Levin, M.: Compiling regular patterns. In: ICFP 2003 (2003)

    Google Scholar 

  16. Meijer, E., Schulte, W.: Unifying tables, objects, and documents. In: DP-COOL 2003 (2003)

    Google Scholar 

  17. Tabuchi, N., Sumii, E., Yonezawa, A.: Regular expression types for strings in a text processing language. In: Workshop on Types in Programming, TIP (2002)

    Google Scholar 

  18. Vansummeren, S.: Unique pattern matching in strings. Technical report, University of Limburg (2003), http://arXiv.org/abs/cs/0302004

  19. W3C Recommendation. Extensible Markup Language (XML) 1.0 (2000)

    Google Scholar 

  20. W3C Recommandation. XML Schema (2001)

    Google Scholar 

  21. Xi, H.: Dependent types for program termination verification. In: Logic in Computer Science (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Normale Supérieure (Paris),  

    Alain Frisch

  2. École Nationale Supérieure des Télécommunications (Paris),  

    Alain Frisch

  3. Microsoft Research,  

    Luca Cardelli

Authors
  1. Alain Frisch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Cardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frisch, A., Cardelli, L. (2004). Greedy Regular Expression Matching. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation