Zobrazeno 1 - 10
of 754
pro vyhledávání: '"LR parser"'
Autor:
G. Butler, C. Mingins
Publikováno v:
TOOLS (37)
Argues that a parser generator can be developed that: (1) can bring parser technology within the reach of more software engineers, (2) requires less knowledge of parser technology than most existing parser generators, and (3) can allow a parser to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d14ced6f7133994535a33057be97965
Autor:
Gyung Ok Lee
Publikováno v:
Journal of KIISE. 48:352-357
Publikováno v:
Journal of KIISE. 47:52-60
Autor:
Mark Minas
Publikováno v:
GCM@STAF
Electronic Proceedings in Theoretical Computer Science, Vol 309, Iss Proc. GCM 2019, Pp 71-86 (2019)
Electronic Proceedings in Theoretical Computer Science, Vol 309, Iss Proc. GCM 2019, Pp 71-86 (2019)
Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) grammars is very efficient, but restricted to a subclass of unambiguous HR grammars. To overcome this restriction, we have recently extended PSR parsing to generalized PSR (GPSR) pa
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-24
This paper proposes a fluent API generator for Scala, Haskell, and C++. It receives a grammar definition and generates a code skeleton of the library in the host programming language. The generated library is accessed through a chain of method calls;
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-28
We present a novel approach to context-free grammar parsing that is based on generating a sequence of grammars called derivative grammars from a given context-free grammar and input string. The generation of the derivative grammars is described by a
Autor:
Nico Hochgeschwender, Artur Baranowski
Publikováno v:
Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021
ACL/IJCNLP (Findings)
ACL/IJCNLP (Findings)
Target meaning representations for semantic parsing tasks are often based on programming or query languages, such as SQL, and can be formalized by a context-free grammar. Assuming a priori knowledge of the target domain, such grammars can be exploite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19529f9270df628562fbfb0a8b7a3d73
https://pub.h-brs.de/files/5780/2021-findings-acl-108.pdf
https://pub.h-brs.de/files/5780/2021-findings-acl-108.pdf
Autor:
Boštjan Slivnik
Publikováno v:
Computer Languages, Systems & Structures. 50:108-126
As described in Slivnik (2016), LLLR parsing is a method that parses as much of its input string as possible using the backbone SLL(k) parser and uses small embedded canonical left LR(k) parsers to resolve LL conflicts. Once the LL conflict is resolv
Autor:
Kwanghoon Choi, Isao Sasano
Publikováno v:
PEPM@POPL
This paper presents a text-based syntax completion method using an LR parser. We propose formal definitions of candidate text to be completed based on the sentential forms, and we design algorithms for computing candidates through reductions in the L
Autor:
Lukas Junek, Jiri Stastny
Publikováno v:
Recent Advances in Soft Computing and Cybernetics ISBN: 9783030616588
An analysis of text and image data is today one of the core fields of artificial intelligence. Among the means that can be used to process this information are structural methods. However, input chain deformations can often occur when analyzing data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e4eaea006ce8bef04a9a14ea80f2273
https://doi.org/10.1007/978-3-030-61659-5_25
https://doi.org/10.1007/978-3-030-61659-5_25