Results 41 to 50 of about 5,692,247 (342)

Application of Regular Grammar in the Syntactic Analysis of Email Addresses

open access: yesIngeniería, 2023
Context: This article proposes the use of regular grammar as a strategy to validate the textual structures of emails. It focuses on the RFC 5321 standard and its syntax, formalizing regular grammars to apply production rules with the aim of validating ...
Cristian Alejandro Fandiño-Mesa   +2 more
doaj   +1 more source

Why aren’t regular expressions a lingua franca? an empirical study on the re-use and portability of regular expressions [PDF]

open access: yesESEC/SIGSOFT FSE, 2019
This paper explores the extent to which regular expressions (regexes) are portable across programming languages. Many languages offer similar regex syntaxes, and it would be natural to assume that regexes can be ported across language boundaries. But can
James C. Davis   +4 more
semanticscholar   +1 more source

The Complexity of Aggregates over Extractions by Regular Expressions [PDF]

open access: yesLogical Methods in Computer Science, 2023
Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from text.
Johannes Doleschal   +2 more
doaj   +1 more source

Cold-start and Interpretability: Turning Regular Expressions into Trainable Recurrent Neural Networks

open access: yesConference on Empirical Methods in Natural Language Processing, 2020
Neural networks can achieve impressive performance on many natural language processing applications, but they typically need large labeled data for training and are not easily interpretable.
Chengyue Jiang   +4 more
semanticscholar   +1 more source

Regexes are Hard: Decision-Making, Difficulties, and Risks in Programming Regular Expressions [PDF]

open access: yesInternational Conference on Automated Software Engineering, 2019
Regular expressions (regexes) are a powerful mechanism for solving string-matching problems. They are supported by all modern programming languages, and have been estimated to appear in more than a third of Python and JavaScript projects.
IV LouisG.Michael   +4 more
semanticscholar   +1 more source

Multifamily Classification of Android Malware With a Fuzzy Strategy to Resist Polymorphic Familial Variants

open access: yesIEEE Access, 2020
The Multifamily classification of Android malware aims to identify a malicious sample as one of the given malware families. This problem is believed to be much more significant than the binary classification (simply identify a sample as malicious or ...
Xiaojian Liu   +3 more
doaj   +1 more source

Forkable Regular Expressions [PDF]

open access: yes, 2016
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as ...
Sulzmann, Martin, Thiemann, Peter
openaire   +3 more sources

Helping tools for the regular expression author for test questions in LMS Moodle

open access: yesОткрытое образование (Москва), 2016
Composing regular expressions for test questions is often a difficult thing for the teachers; so many teachers avoid using regular expression questions. Similar problems hinder students learning regular expressions as a part of computer science.
O. A. Sychev, G. V. Terehov
doaj   +1 more source

Rewriting of regular expressions and regular path queries [PDF]

open access: yesProceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego Calvanese   +3 more
openaire   +5 more sources

Regularity preserving modifications of regular expressions

open access: yesInformation and Control, 1963
This paper is concerned with the problem of determining whether a set of sequences R\t', obtained by some given rule from a regular set of sequences R, is again a regular set. A number of such problems are solved in this paper and a basic technique is used which is easy to apply to problems of this type.
Richard Edwin Stearns, Juris Hartmanis
openaire   +2 more sources

Home - About - Disclaimer - Privacy