An implementation of an $LLP(q,k)$ parser generator is presented. Such a parser generator is able to generate parsers suitable for data parallelism. This generator is utilized to create a JSON parser, the performance of which is measured and compared against existing JSON parsers.
Extended Abstract (array24-paper3.pdf) | 363KiB |
Tue 25 JunDisplayed time zone: Windhoek change
Tue 25 Jun
Displayed time zone: Windhoek change
10:40 - 12:20 | |||
10:40 25mTalk | AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming ARRAY Robert Schenck DIKU, University of Copenhagen, Nikolaj Hey Hinnerskov DIKU, University of Copenhagen, Troels Henriksen University of Copenhagen, Magnus Madsen Aarhus University, Martin Elsman University of Copenhagen, Denmark File Attached | ||
11:05 25mTalk | An LLP (q, k) Parser Generator ARRAY File Attached | ||
11:30 25mTalk | Mechanical Proofs in an Array-Combinator Language ARRAY Nikolaj Hey Hinnerskov DIKU, University of Copenhagen, Robert Schenck DIKU, University of Copenhagen, Cosmin Oancea University of Copenhagen, Denmark File Attached | ||
11:55 25mTalk | Translating Concepts of the Futhark Programming Language into an Extended Pi-Calculus ARRAY Chris Oliver Paulsen Department of Computer Science, Aalborg University, Lars Jensen , Julian Teule Department of Computer Science, Aalborg University, Hans Hüttel Department of Computer Science, Aalborg University File Attached |