Sökning: id:"swepub:oai:DiVA.org:umu-192857" >
Regular Expressions...
Regular Expressions with Backreferences Re-examined
-
- Berglund, Martin, 1981- (författare)
- Umeå universitet,Institutionen för datavetenskap,Department of Information Science, Stellenbosch University, South Africa
-
- van der Merwe, Brink (författare)
- Department of Computer Science, Stellenbosch University, South Africa
-
(creator_code:org_t)
- Praque Stringology Club, 2017
- 2017
- Engelska.
-
Ingår i: Proceedings of the Prague Stringology Conference 2017. - : Praque Stringology Club. - 9788001061930 ; , s. 30-41
- Relaterad länk:
-
http://www.stringolo...
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- Most modern regular expression matching libraries (one of the rare exceptions being Google’s RE2) allow backreferences, operations which bind a substring to avariable allowing it to be matched again verbatim. However, different implementations not only vary in the syntax permitted when using backreferences, but both implementations and definitions in the literature offer up a number of different variants on how backreferences match. Our aim is to compare the various flavors by considering the formal languages that each can describe, resulting in the establishment of a hierarchy of language classes. Beyond the hierarchy itself, some complexity results are given, and as part of the effort on comparing language classes new pumping lemmas are established, and old ones extended to new classes.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas