Zobrazeno 1 - 10
of 1 245
pro vyhledávání: '"Parser combinator"'
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:
Jamie Willis, Nicolas Wu
Publikováno v:
Haskell
ACM SIGPLAN Haskell Symposium 2021
ACM SIGPLAN Haskell Symposium 2021
Parser combinators are a popular and elegant approach for parsing in functional languages. The design and implementation of such libraries are well discussed, but having a well-designed library is only one-half of the story. In this paper we explore
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::381c0ce3571b8dcc956b40acc2cef571
https://doi.org/10.1145/3471874.3472984
https://doi.org/10.1145/3471874.3472984
Autor:
Марченко, Олександр Іванович
Кваліфікаційна робота включає пояснювальну записку (54 с., 45 рис., 4 додатки). Об’єкт розробки — створення системи для підтримки роботи з JS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2635::b3bd11c85e259787797271bab87514e8
https://ela.kpi.ua/handle/123456789/43154
https://ela.kpi.ua/handle/123456789/43154
Publikováno v:
arXiv
It is a neat result from functional programming that libraries of parser combinators can support rapid construction of decoders for quite a range of formats. With a little more work, the same combinator program can denote both a decoder and an encode
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61132ceaae744e441ac8ce6bf8b9821c
https://doi.org/10.1145/3341686
https://doi.org/10.1145/3341686
Autor:
Mikhail Kuznetsov, Georgii Firsov
Publikováno v:
2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus).
Parser combinators is a popular approach to parsing sequences generated by context-free grammars, which can be specialized data formats (e.g. JSON, YAML), markup languages like XML or HTML. At the same time, this approach is rarely used for parsing p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee43fbe416ee00e6ce3820a5c02080b3
https://doi.org/10.1109/elconrus51938.2021.9396311
https://doi.org/10.1109/elconrus51938.2021.9396311
Publikováno v:
ESEC/SIGSOFT FSE
One of the key properties of a program is its input specification. Having a formal input specification can be critical in fields such as vulnerability analysis, reverse engineering, software testing, clone detection, or refactoring. Unfortunately, ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f174c9e4d397a625001f6c27c230e7e6
https://doi.org/10.1145/3368089.3409679
https://doi.org/10.1145/3368089.3409679
Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90268a667e852e53fa3665916987248c
http://hdl.handle.net/10044/1/85700
http://hdl.handle.net/10044/1/85700
Publikováno v:
Journal of Computer Languages, 58
Generalised parsing has become increasingly important in the context of software language design and several compiler generators and language workbenches have adopted generalised parsing algorithms such as GLR and GLL. The original GLL parsing algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74e4de56e6e18911a980eee0503e3ac1
https://ir.cwi.nl/pub/29663
https://ir.cwi.nl/pub/29663
Autor:
Jiangming Liu, Yue Zhang
Publikováno v:
Transactions of the Association for Computational Linguistics. 5:45-58
Transition-based models can be fast and accurate for constituent parsing. Compared with chart-based models, they leverage richer features by extracting history information from a parser stack, which consists of a sequence of non-local constituents. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f6e59d34edfadabaab4a8dcde1f63a8
https://doi.org/10.1162/tacl_a_00045
https://doi.org/10.1162/tacl_a_00045
Publikováno v:
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
International audience; The syntax of the C programming language is described in the C11 standard by an ambiguous context-free grammar, accompanied with English prose that describes the concept of " scope " and indicates how certain ambiguous code fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33a46063777587db07c9fd0a434b2a26
https://doi.org/10.1145/3064848
https://doi.org/10.1145/3064848