Tunnel Parsing with the Token’s Lexeme
The article describes a string recognition approach, engraved in the parsers generated by Tunnel Grammar Studio that use the tunnel parsing algorithm, of how a lexer and a parser can operate on the input during its recognition. Proposed is an addition of the augmented Backus-Naur form syntax that en...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2022-06-01
|
| Series: | Cybernetics and Information Technologies |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/cait-2022-0021 |
| _version_ | 1828824076419858432 |
|---|---|
| author | Handzhiyski Nikolay Somova Elena |
| author_facet | Handzhiyski Nikolay Somova Elena |
| author_sort | Handzhiyski Nikolay |
| collection | DOAJ |
| description | The article describes a string recognition approach, engraved in the parsers generated by Tunnel Grammar Studio that use the tunnel parsing algorithm, of how a lexer and a parser can operate on the input during its recognition. Proposed is an addition of the augmented Backus-Naur form syntax that enables the formal language to be expressed with a parser grammar and optionally with an additional lexer grammar. The tokens outputted from the lexer are matched to the phrases in the parser grammar by their name and optionally by their lexeme, case sensitively or insensitively. |
| first_indexed | 2024-12-12T13:49:41Z |
| format | Article |
| id | doaj.art-fa67e72dfb974cb8ba338e002032608c |
| institution | Directory Open Access Journal |
| issn | 1314-4081 |
| language | English |
| last_indexed | 2024-12-12T13:49:41Z |
| publishDate | 2022-06-01 |
| publisher | Sciendo |
| record_format | Article |
| series | Cybernetics and Information Technologies |
| spelling | doaj.art-fa67e72dfb974cb8ba338e002032608c2022-12-22T00:22:36ZengSciendoCybernetics and Information Technologies1314-40812022-06-0122212514410.2478/cait-2022-0021Tunnel Parsing with the Token’s LexemeHandzhiyski Nikolay0Somova Elena1University of Plovdiv “Paisii Hilendarski”, 24 Tzar Assen Str., 4000Plovdiv, BulgariaUniversity of Plovdiv “Paisii Hilendarski”, 24 Tzar Assen Str., 4000Plovdiv, BulgariaThe article describes a string recognition approach, engraved in the parsers generated by Tunnel Grammar Studio that use the tunnel parsing algorithm, of how a lexer and a parser can operate on the input during its recognition. Proposed is an addition of the augmented Backus-Naur form syntax that enables the formal language to be expressed with a parser grammar and optionally with an additional lexer grammar. The tokens outputted from the lexer are matched to the phrases in the parser grammar by their name and optionally by their lexeme, case sensitively or insensitively.https://doi.org/10.2478/cait-2022-0021parsing algorithmtunnel parsinglexeme matchingadvanced grammarphrase state machine |
| spellingShingle | Handzhiyski Nikolay Somova Elena Tunnel Parsing with the Token’s Lexeme Cybernetics and Information Technologies parsing algorithm tunnel parsing lexeme matching advanced grammar phrase state machine |
| title | Tunnel Parsing with the Token’s Lexeme |
| title_full | Tunnel Parsing with the Token’s Lexeme |
| title_fullStr | Tunnel Parsing with the Token’s Lexeme |
| title_full_unstemmed | Tunnel Parsing with the Token’s Lexeme |
| title_short | Tunnel Parsing with the Token’s Lexeme |
| title_sort | tunnel parsing with the token s lexeme |
| topic | parsing algorithm tunnel parsing lexeme matching advanced grammar phrase state machine |
| url | https://doi.org/10.2478/cait-2022-0021 |
| work_keys_str_mv | AT handzhiyskinikolay tunnelparsingwiththetokenslexeme AT somovaelena tunnelparsingwiththetokenslexeme |