Bibliographic Details
| Title: |
TUNNEL PARSING WITH COUNTED REPETITIONS. |
| Authors: |
HANDZHIYSKI, NIKOLAY, SOMOVA, ELENA |
| Source: |
Computer Science; 2020, Vol. 21 Issue 4, p441-462, 22p |
| Subject Terms: |
PARSING (Grammar), TUNNELS, ALGORITHMS, GRAMMAR, TUNNEL design & construction, TUNNEL lining |
| Abstract: |
This article describes a new and efficient algorithm for parsing (called tunnel parsing) that parses from left to right on the basis of context-free grammar without left recursion nor rules that recognize empty words. The algorithm is mostly applicable for domain-specific languages. In the article, particular at- tention is paid to the parsing of grammar element repetitions. As a result of the parsing, a statically typed concrete syntax tree is built from top to bottom, that accurately reflects the grammar. The parsing is not done through a recursion, but through an iteration. The tunnel parsing algorithm uses the grammars directly without a prior refactoring and is with a linear time complexity for deterministic context-free grammars. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Science is the property of AGH University of Science & Technology Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Nájsť tento článok vo Web of Science