From ambiguous regular expressions to deterministic parsing automata (Q2947407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6484729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From ambiguous regular expressions to deterministic parsing automata |
scientific article; zbMATH DE number 6484729 |
Statements
From Ambiguous Regular Expressions to Deterministic Parsing Automata (English)
0 references
23 September 2015
0 references
regular expression
0 references
syntax tree
0 references
Berry-Sethi algorithm
0 references
ambiguity
0 references
parsing
0 references
0 references
0.9275090098381042
0 references
0.840101957321167
0 references
0.7959489226341248
0 references
