All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Optimizing Parser Combinators

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F16%3A00302490" target="_blank" >RIV/68407700:21240/16:00302490 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.esug.org/data/ESUG2016/IWST/Papers/IWST_2016_paper_3.pdf" target="_blank" >http://www.esug.org/data/ESUG2016/IWST/Papers/IWST_2016_paper_3.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2991041.2991042" target="_blank" >10.1145/2991041.2991042</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimizing Parser Combinators

  • Original language description

    Parser combinators are a popular approach to pars-ing. Parser combinators follow the structure of an un-derlying grammar, are modular, well-structured, easyto maintain, and can recognize a large variety of lan-guages including context-sensitive ones. However, theiruniversality and flexibility introduces a noticeable per-formance overhead. Time-wise, parser combinators can-not compete with parsers generated by well-performingparser generators or optimized hand-written code.Techniques exist to achieve a linear asymptotic per-formance of parser combinators, yet there is still a sig-nificant constant multiplier. This can be further loweredusing meta-programming techniques.In this work we present a more traditional approachto optimization — a compiler — applied to the do-main of parser combinators. A parser combinator com-piler (pc-compiler) analyzes a parser combinator, ap-plies parser combinator-specific optimizations and, gen-erates an equivalent high-performance top-down parser.Such a compiler preserves the advantages of parser com-binators while complementing them with better perfor-mance.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    IWST'16 Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies

  • ISBN

    978-1-4503-4524-8

  • ISSN

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Praha

  • Event date

    Aug 22, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000390845100001