✦ LIBER ✦

Efficient generation of lexical analysers

✍ Scribed by J. Grosch

Book ID: 112210527
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 716 KB
Volume: 19
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380191106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Implementation of Semantic Rel

Efficient Implementation of Semantic Relations in Lexical Databases

✍ Uta Priss 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Automatic generation of lexical analyzer

Automatic generation of lexical analyzers in a compiler-compiler

✍ Roman Krzemień; Andrzej Lukasiewicz 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Use of opposite-relation lexical stimuli

Use of opposite-relation lexical stimuli in concept generation

✍ I. Chiu; L.H. Shu 📂 Article 📅 2008 🏛 International Academy for Production Engineering 🌐 English ⚖ 221 KB

The generation effect: Further tests of

The generation effect: Further tests of the lexical activation hypothesis

✍ David G. Payne; James H. Neely; Daniel J. Burns 📂 Article 📅 1986 🏛 Psychonomic Society Publications 🌐 English ⚖ 947 KB

Efficient generation of plane trees

✍ Shin-ichi Nakano 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without dupl

Efficient generation of graphical partit

Efficient generation of graphical partitions

✍ Tiffany M. Barnes; Carla D. Savage 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Given a positive even integer n, we show how to generate the set G(n) of graphical partitions of n, that is, those partitions of n which correspond to the degree sequences of simple, undirected graphs. The algorithm is based on a recurrence for G(n), and the total time used by the algorithm, indepen