Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 32 for “"Regular expressions"”.
-
The validity problem for extended regular expressions
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Exploring the Process and Challenges of Programming with Regular Expressions
Regular expressions (regexes) are a powerful mechanism for solving string-matching problems and are supported by all modern programming languages. While regular expressions are highly expressive, they are also often perceived to be highly complex and hard to read. While existing studies have …
-
A technique for converting NFA's and DFA's to regular expressions in Lex
<p>In the design and creation of compilers, a compiler-writer is called upon to make assumptions and declarations about how their language's syntax performs and behaves. Lex is a software tool used to create grammar rules. A flat file is read as input to lex, and the corresponding C code is output. …
-
miRNAMatcher: High throughput miRNA discovery using regular expressions obtained via a genetic algorithm
In summary there currently exist techniques to discover miRNA however both require many calculations to be performed during the identification limiting their use at a genomic level. Machine learning techniques are currently providing the best results by combining a number of calculated and …
-
Generating regular expressions from natural language specifications: A semantics-based approach and an empirical study
… forms. In this thesis, we focus on generating regular expressions from natural language, an important task of the program-synthesis problem. In particular, we study the task in two aspects. First, we address the issue of Program Aliasing, and propose a semantics-based approach named SemRegex. …
-
Text Identification by Example
… the data that they are interested in. Building a regular expression to match the text they are interested in will automate the process, but regular expressions are hard to create and certainly are not feasible for non-programmers to construct. Text Identification by Example (TIBE) makes it easier …
-
CSA-X: Modularized Constrained Multiple Sequence Alignment
… where researchers used anchor points, regular expressions, or context-free-grammars to specify the constraints, wherein alignments produced are forced to align around segments that match the constraints. In this thesis, we propose CSA-X, a modularized program of constrained multiple …
-
A Framework for the Design and Generation of Spatial MFSA Accelerators: The SPARX Approach
… research into automata-based accelerators. Regular expressions, while expressive and versatile, impose significant computational overhead when evaluated over massive data streams. Traditional CPU and GPU solutions, despite vectorization and multi-threading, remain constrained by the …
-
Infixer: A Method for Segmenting Non-Concatenative Morphology in Tagalog
… patterns into concatenative ones using regular expressions, which allows the algorithm to operate on the input data as it would any other data. The target language for this project is Tagalog, a major language of the Philippines that makes extensive use of non- concatenative morphology, …
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
… can be described by finite automata are known as regular languages. Owing to their versatility, regular languages have received a great deal of attention over the years. Other formalisms were shown to be expressively equivalent to finite automata, most notably regular grammars, regular …
-
Implementing BREeze - a High-Performance Regular Expression Library Using Code Generation with BuildIt
Regular expression matching is a very common problem in software engineering, with applications in text processing, text searching, data scraping, syntax highlighting, deep packet inspection in networks, etc. Due to the varying complexity of regular expressions, having one general approach to match …
-
Natural language processing on encrypted patient data
… for locating keywords, matching approximate regular expressions, and computing frequency analysis on encrypted data. We present a full implementation of this system in the form of a extendible software library and a command line interface. Finally, we discuss a medical case study where we …
-
Pattern recognition for computer security
… addresses email-campaign detection. We focus on regular expressions as a syntactic framework, because regular expressions are intuitively comprehensible by security engineers and administrators, and they can be applied as a detection mechanism in an extremely efficient manner. In this setting, a …
-
Emergency Medical Service EMR-Driven Concept Extraction From Narrative Text
… spacy for analyzing the sentence structure and regular expressions to recurring patterns, to retrieve patient-specific information from medical narratives. These concept value pairs automatically populates the fields of an EMR form which could be reviewed and modified manually if needed. This …
-
An object-oriented parser generator for LL(1) grammars
… of the language's grammar which contains regular expressions and offer an easy notation to specify semantic actions is documented
-
Automatically Generating Tests from Natural Language Descriptions of Software Behavior
… to manually written code steps (typically using regular expressions). Instead of requiring programmers to write manual glue code, this thesis investigates a practical approach to con- vert natural language scenario descriptions into executable software tests fully automatically. To show …
-
Goal and Preference Identification in Natural Language Expressions
… language statement is first matched through regular expressions to distinguish between the preference component and the goal component. The former is then mapped to a preferential strength measure, while the latter is used to identify the relevant goal in the goal model through statistical …
-
The transformational implementation of JSD process specifications via finite automata representation
… Jackson structure diagrams are equivalent to regular expressions and can be thought of as specifying corresponding finite automata. The thesis discusses the automatic transformation of structure diagrams into finite automata using an algorithm adapted from compiler theory, and then extends the …
-
MLVR: Regular Expression-Based Specification for Verified Model Checking of Hardware
… implementations. The syntax of MLVR is based on regular expressions, where we specify what traces of inputs and outputs from the system are acceptable. We offer support for variables to be remembered and later recalled, and we allow for treating the values of variables symbolically during model …
-
Theory and Patterns for Avoiding Regex Denial of Service
Regular expressions are ubiquitous. They are used for diverse purposes, including input validation and firewalls. Unfortunately, they can also lead to a security vulnerability called ReDoS(Regular Expression Denial of Service), caused by a super-linear worst-case execution time during regex …
Page 1 of 2