Structuring the GLL parsing algorithm for performance
نویسندگان
چکیده
منابع مشابه
GLL Parsing
Recursive Descent (RD) parsers are popular because their control flow follows the structure of the grammar and hence they are easy to write and to debug. However, the class of grammars which admit RD parsers is very limited. Backtracking techniques may be used to extend this class, but can have explosive runtimes and cannot deal with grammars with left recursion. Tomita-style RNGLR parsers are ...
متن کاملFaster, Practical GLL Parsing
Generalized LL (GLL) parsing is an extension of recursivedescent (RD) parsing that supports all context-free grammars in cubic time and space. GLL parsers have the direct relationship with the grammar that RD parsers have, and therefore, compared to GLR, are easier to understand, debug, and extend. This makes GLL parsing attractive for parsing programming languages. In this paper we propose a m...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولIsland Grammar-Based Parsing Using GLL and Tom
Extending a language by embedding within it another language presents significant parsing challenges, especially if the embedding is recursive. The composite grammar is likely to be nondeterministic as a result of tokens that are valid in both the host and the embedded language. In this paper we examine the challenges of embedding the Tom language into a variety of general-purpose high level la...
متن کاملEPSILON FACTOR FOR GLl × GLl ′; l ̸ = l ′ PRIMES
Let F be a non-Archimedean local field with finite residual field of characteristic p. In this article we calculate the ε-factor of pairs for GLl(F ) ×GLl′(F ) where l and l are distinct primes including the case l = p. For this calculation, we use the local Langlands correspondence and non-Galois base change lift. This method leads to the explicit conjecture of the ε-factor of the representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2016
ISSN: 0167-6423
DOI: 10.1016/j.scico.2016.04.003