Searching for ""Maximal-munch" Tokenization in Linear Time." – sorted by Relevance.
-
Maximal-munch” tokenization in linear time
- “Maximal-Munch” Tokenization in Linear Time THOMAS REPS University of Wisconsin
- Cited by 5 (0 self) – Add To MetaCart
-
Maximal-Munch" Tokenization in Linear Time
- “Maximal-Munch” Tokenization in Linear Time THOMAS REPS University of Wisconsin
- Add To MetaCart
-
Rewriting Strategies for Instruction Selection
- the tree tilings selected. The following strategy takes this approach: maximal-munch = topdown
- Cited by 9 (8 self) – Add To MetaCart
-
LR Parsing of CFG's with Restrictions
- maximal-munch approach [2-4]. Shift/reduce conflicts are resolved in favour of shifts and reduce
- Cited by 1 (0 self) – Add To MetaCart
-
The Lexical Structure of Verdi
- �� TOKEN ) g Tokenize is, in fact, a partial function. We first show that the maximal munch principle
- Add To MetaCart
-
Retargetable code generation based on structural processor descriptions. Design Automation for Embedded Systems
- target-independent code selection method ("maximal munching method"), based on heuristic tree covering
- Cited by 37 (4 self) – Add To MetaCart
-
Refactoring programs to secure information flows
- in the high component. Refactoring is best accomplished in a maximal munch-style, taking the largest possible
- Cited by 3 (0 self) – Add To MetaCart
-
Structure of the SPARC Verdi Compiler
- , separators are discarded during the scanning process, not afterwards. The maximal munch principle is used
- Add To MetaCart
-
A Standard Library Proposal for Haskell 1.3 - Version 3
- . The "maximal munch" rule is used to distinguish Bag.toList from Bag . toList which is the composition of a
- Add To MetaCart
-
Formal verification of pipeline control using controlled token nets and abstract interpretation
- of the datapath. We introduced property-specification language Token Linear Time Logic (TLTL) by extending Linear
- Cited by 8 (1 self) – Add To MetaCart

