IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i14p2436-d861775.html
   My bibliography  Save this article

RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages

Author

Listed:
  • Žiga Leber

    (Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia)

  • Matej Črepinšek

    (Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia)

  • Marjan Mernik

    (Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia)

  • Tomaž Kosar

    (Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia)

Abstract

The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character-level context-free languages (CFL). We present a novel scanner-based architecture that for any given CFG accepts all corresponding character-level CFLs. It can directly parse all possible specifications consisting of a grammar and regular definitions. The architecture is based on right-nulled generalized LR (RNGLR) parsing and is a generalization of the context-aware scanning architecture. Our architecture does not require any disambiguation rules to resolve lexical conflicts, it conceptually has an unbounded parser and scanner lookahead and it is streaming. The added robustness and flexibility allow for easier grammar development and modification.

Suggested Citation

  • Žiga Leber & Matej Črepinšek & Marjan Mernik & Tomaž Kosar, 2022. "RNGSGLR: Generalization of the Context-Aware Scanning Architecture for All Character-Level Context-Free Languages," Mathematics, MDPI, vol. 10(14), pages 1-48, July.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2436-:d:861775
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/14/2436/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/14/2436/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Boštjan Slivnik & Marjan Mernik, 2023. "On Parsing Programming Languages with Turing-Complete Parser," Mathematics, MDPI, vol. 11(7), pages 1-27, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2436-:d:861775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.