Zobrazeno 1 - 10
of 672
pro vyhledávání: '"Deterministic context-free grammar"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mikhail Barash, Alexander Okhotin
Publikováno v:
Theoretical Computer Science. 719:73-85
Grammars with contexts are an extension of context-free grammars equipped with operators for referring to the left and the right contexts of a substring being defined. These grammars are notable for still having a cubic-time parsing algorithm, as wel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9fae104003f2c65483705933064c267
https://doi.org/10.1016/j.tcs.2017.11.006
https://doi.org/10.1016/j.tcs.2017.11.006
Autor:
Matthew Might, Michael D. Adams
Publikováno v:
Proceedings of the ACM on Programming Languages. 1:1-25
Precedence and associativity declarations in systems like yacc resolve ambiguities in context-free grammars (CFGs) by specifying restrictions on allowed parses. However, they are special purpose and do not handle the grammatical restrictions that lan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95ae9e0d892062cdca15fa126f35e733
https://doi.org/10.1145/3133906
https://doi.org/10.1145/3133906
Autor:
Maryam Ghorani
Publikováno v:
Soft Computing. 23:1123-1131
This paper introduces the concepts of fuzzy tree pushdown automata and fuzzy context-free tree grammars. At first, we show that any fuzzy context-free tree grammar can be converted into a corresponding definition of fuzzy Chomsky normal form for tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bc79123e9f08b7abb807f42a02b8c7e
https://doi.org/10.1007/s00500-017-2829-7
https://doi.org/10.1007/s00500-017-2829-7
Autor:
Viliam Geffert, Zuzana Bednárová
Publikováno v:
Information and Computation. 253:381-398
We shall consider nondeterministic and deterministic automata equipped with a limited pushdown (constant height npda s and dpda s) as well as their two-way versions (constant height 2 npda s and 2 dpda s). We show two double-exponential gaps for thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42c6dd4fa9a9e2d1c61b6b98c4800b72
https://doi.org/10.1016/j.ic.2016.06.005
https://doi.org/10.1016/j.ic.2016.06.005
Autor:
Kazuyuki Tanaka, Wenjuan Li
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 51:29-50
We investigate the determinacy strength of infinite games whose winning sets are recognized by nondeterministic pushdown automata with various acceptance conditions, e.g. , safety, reachability and co-Buchi conditions. In terms of the foundational pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::816be4767aa346d159723635e1e0a688
https://doi.org/10.1051/ita/2017006
https://doi.org/10.1051/ita/2017006
Autor:
Alexander Okhotin, Kai Salomaa
Publikováno v:
Journal of Computer and System Sciences. 86:207-228
The family of languages recognized by deterministic input-driven pushdown automata (IDPDA; a.k.a. visibly pushdown automata, a.k.a. nested word automata) is known to be closed under concatenation, Kleene star and reversal (under natural assumptions o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d30f4119ea1a06f1b35075d706343f4
https://doi.org/10.1016/j.jcss.2017.02.001
https://doi.org/10.1016/j.jcss.2017.02.001
Publikováno v:
Texts in Computer Science ISBN: 9783030048785
Texts in Computer Science ISBN: 9781447155133
Texts in Computer Science ISBN: 9781447155133
This chapter covers pushdown automata and parsing algorithms with emphasis on the application to syntax analysis. We start by introducing general and deterministic pushdown automata as recognizers of context-free and deterministic context-free langua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08f05235fc5365e286813c730fa2966c
https://doi.org/10.1007/978-3-030-04879-2_4
https://doi.org/10.1007/978-3-030-04879-2_4
Autor:
Michael Kaminski, Tamar Aizikowitz
Publikováno v:
Journal of Computer and System Sciences. 82:1329-1359
The paper introduces a subfamily of synchronized alternating pushdown automata, deterministic synchronized alternating pushdown automata, and a subfamily of conjunctive grammars, L R ( 0 ) conjunctive grammars. It is shown that deterministic synchron
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5df8fc11d503b42c42ee94dde2caf6b6
https://doi.org/10.1016/j.jcss.2016.05.008
https://doi.org/10.1016/j.jcss.2016.05.008
Publikováno v:
Computer Languages, Systems & Structures. 46:91-105
New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented. The algorithms improve the results of existing algorithms. They construct only accessible states a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcf4e40c54eaee90f73059deda5cf6e5
https://doi.org/10.1016/j.cl.2016.07.005
https://doi.org/10.1016/j.cl.2016.07.005