University of Twente Student Theses

Login

Replication and Analysis of the Berry-Sethi Parser for Ambiguous Regular Expressions

Broekhof, Ivo (2022) Replication and Analysis of the Berry-Sethi Parser for Ambiguous Regular Expressions.

[img] PDF
311kB
Abstract:Since regular languages, often described with Regular Expressions, are much faster to parse than context-free languages, it can prove beneficial to define regular (parts of) languages using Regular Expressions rather than the more powerful yet slower to parse Context-Free Grammars. However, ambiguity in regular expressions can make this task more difficult. We have successfully replicated a deterministic parser generator for Ambiguous Regular Expressions, based on the Berry-Sethi algorithm, in Kotlin.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science BSc (56964)
Link to this item:https://purl.utwente.nl/essays/92294
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page