Zobrazeno 1 - 10
of 120
pro vyhledávání: '"LL(*) grammar"'
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::412d92985364a5c0d6223e7d70f4784f
https://doi.org/10.1016/j.cl.2017.06.002
https://doi.org/10.1016/j.cl.2017.06.002
Autor:
Yu. L. Kostyuk
Publikováno v:
Prikladnaya diskretnaya matematika. :90-99
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::755447d8cd45f9be0a646fd57bba25f3
https://doi.org/10.17223/20710410/37/7
https://doi.org/10.17223/20710410/37/7
Autor:
Марченко, Олександр Іванович
Кваліфікаційна робота включає пояснювальну записку (52 с., 19 рис., 1 табл., 4 додатки). Об’єкт розробки — розробка комп’ютерної програми ге
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2635::da0ce42dba8499d0841c06693b0d5376
https://ela.kpi.ua/handle/123456789/28682
https://ela.kpi.ua/handle/123456789/28682
Autor:
Andrew C. Myers, Chinawat Isradisaikul
Publikováno v:
PLDI
Writing a parser remains remarkably painful. Automatic parser generators offer a powerful and systematic way to parse complex grammars, but debugging conflicts in grammars can be time-consuming even for experienced language designers. Better tools fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10ffa825babf7f09326cdd300f1696b2
https://doi.org/10.1145/2813885.2737961
https://doi.org/10.1145/2813885.2737961
Autor:
Manish Kumar, Mohit Dua
Publikováno v:
Procedia Computer Science. 58:363-370
Paninian Grammar framework provides a better solution for parsing free word order languages and Stanford Parser gives the dependencies for English language (Fixed word order language). In this paper, we map the Stanford parser dependencies to karaka
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d02c12ad64fd07eb8f30e273cc9bb1a6
https://doi.org/10.1016/j.procs.2015.08.033
https://doi.org/10.1016/j.procs.2015.08.033
Autor:
Wolfgang Menzel, Amr Rekaby Salama
Publikováno v:
Intelligent Natural Language Processing: Trends and Applications ISBN: 9783319670553
Dependency parsing aims at finding an optimal tree representation of the input sentence in terms of word-to-word relationships, which are important for many Natural Language Processing tasks. This requires to diambiguate the linguistic input, a task
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bd9d18823185f7f7f86470f652b0ef7
https://doi.org/10.1007/978-3-319-67056-0_26
https://doi.org/10.1007/978-3-319-67056-0_26
Publikováno v:
International Journal of Software Engineering and Knowledge Engineering. 24:1177-1195
Syntax-directed translation tools require the specification of a language by means of a formal grammar. This grammar must also conform to the specific requirements of the parser generator to be used. Software engineers then annotate the resulting gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c7325230109b2ef56cc54076fd271f4
https://doi.org/10.1142/s0218194014500375
https://doi.org/10.1142/s0218194014500375
Autor:
Hong Jun Tang
Publikováno v:
Applied Mechanics and Materials. 310:684-687
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02b07639b6e0c7a15a4291540e79ef2b
https://doi.org/10.4028/www.scientific.net/amm.310.684
https://doi.org/10.4028/www.scientific.net/amm.310.684
Autor:
Roman R. Redziejowski
Publikováno v:
Fundamenta Informaticae. 128:177-191
Parsing Expression Grammar PEG encodes a recursive-descent parser with limited backtracking. The parser has many useful properties, and with the use of memoization, it works in a linear time. In its appearance, PEG is almost identical to a grammar in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73ee80010b777bc4829f154950dbec19
https://doi.org/10.3233/fi-2013-940
https://doi.org/10.3233/fi-2013-940
Autor:
Norbert Blum
Publikováno v:
Theoretical Computer Science. 267:49-59
Usually, a parser for an LL(k) -grammar G is a deterministic pushdown transducer which produces a leftmost derivation for a given input string x ∈ L(G) . Ukkonen (JCCS 26(1983)153–170) has given a family of LL(2) -grammars proving that every pars
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::665e72b73e6c9669be222c918ee77c91
https://doi.org/10.1016/s0304-3975(00)00295-4
https://doi.org/10.1016/s0304-3975(00)00295-4