150 __ $a Regular expressions (Computer science)
450 __ $a Regexps (Computer science)
450 __ $a Regexes (Computer science)
450 __ $a Rational expressions (Computer science)
550 __ $w g $a Text processing (Computer science)
550 __ $w g $a Programming languages (Electronic computers)
670 __ $a Work cat: 2016962076: Introducing regular expressions, 2017.
670 __ $a 2016302350: Windham, Matthew. Introduction to Regular Expressions in SAS, 2014.
670 __ $a López, Félix. Mastering Python regular expressions, 2014.
670 __ $a 2001034634: Effective awk programming, 2001: $b table of contents (gawk-Specific Regexp Operators […] Using Dynamic Regexps)
670 __ $a Wikipedia article “Regular expression,” viewed online February 7, 2018 $b (A regular expression, regex or regexp (sometimes called a rational expression) is, in theoretical computer science and formal language theory, a sequence of characters that define a search pattern. Usually this pattern is then used by string searching algorithms for “find” or “find and replace” operations on strings.) $u https://en.wikipedia.org/wiki/Regular_expression
670 __ $a Ruby programming language documentation, Regexp class page, viewed 7 February 2018: $b (Regular expressions (regexps) are patterns which describe the contents of a string. They’re used for testing whether a string contains a given pattern, or extracting the portions that match.) $u http://ruby-doc.org/core-2.5.0/Regexp.html
670 __ $a Perl 6 Documentation, Regexes, viewed 7 February 2018: $b(Regular expressions, regexes for short, are a sequence of characters that describe a pattern of text. Pattern matching is the process of matching those patterns to actual text.) $u https://docs.perl6.org/language/regexes
Currently the LCSH “Text processing (Computer science)” is the closest thing we have to express the topic of regular expressions.
However, text processing is an enormous subject—much broader than any work that is specifically about regular expressions.
- there are works about the formal logic and mathematics of implementing, parsing, and using regular expressions, which have little direct relation to text processing as a subject
- there are works about using regular expressions or regular expression-like languages to query/manipulate non-textual data
Other headings with BT: Text processing (Computer science):
- Automatic indexing
- Document markup languages
- Latent semantic indexing
- Word processing
This is a pretty odd miscellany of NTs for Text processing. Regular expressions would fit as well as any of the others do here. I’d argue it’s far more appropriate here than “Microformats”
Other headings with BT: Programming languages (Electronic computers):
- Pseudocode (Computer program language) — a combination of programming language and natural language used for computer program design
- Query languages (Computer science) — a system designed to support an interactive dialogue for the retrieval, display, and sometimes update, of records, using variable criteria
- XPath (Computer program language)
Among the myriad headings for specific programming languages (Ruby, Perl, Python, etc.) established as NTs of Programming languages (Electronic computers), you will also find the above-listed headings.
Like pseudocode, regexes are a ‘meta’ concept/skill in programming (as well as in using information retrieval and/or processing tools with advanced search/replace capabilities).
Like query languages, regexes are for retrieving and updating — but for strings, not records.
Like XPath, regexes are useful for identifying/selecting specific chunks of information on which to operate.
Examples works about regular expressions used to querying/processing other types of data:
- 670 __ miRNAMatcher: High throughput miRNA discovery using regular expressions obtained via a genetic algorithm, 2014 (OCLC#: 887788641)
- 670 __ 3D Regular Expressions – Searching Shapes in Meshes, 2013
Examples of works about regular expressions as a more abstract computer science/logical/mathematical topic, which are not about text processing:
- 670 __ Using Semantic Unification to Generate Regular Expressions from Natural Language , 2013 (OCLC#: 854545240 — semantic query parsing)
- 670 __ Finite automata and regular expressions, 2013 (OCLC#: 869466959 — computer science theory)
- 670 __ 70865086: On axiom systems for regular expressions and on equations involving language, 1971 (Formal languages)