Eli   Documents Get Eli: Translator Construction Made Easy at SourceForge.net.
    Fast, secure and Free Open Source software downloads

General Information

 o Eli: Translator Construction Made Easy
 o Global Index
 o Frequently Asked Questions
 o Typical Eli Usage Errors

Tutorials

 o Quick Reference Card
 o Guide For new Eli Users
 o Release Notes of Eli
 o Tutorial on Name Analysis
 o Tutorial on Type Analysis
 o Typical Eli Usage Errors

Reference Manuals

 o User Interface
 o Eli products and parameters
 o LIDO Reference Manual
 o Typical Eli Usage Errors

Libraries

 o Eli library routines
 o Specification Module Library

Translation Tasks

 o Lexical analysis specification
 o Syntactic Analysis Manual
 o Computation in Trees

Tools

 o LIGA Control Language
 o Debugging Information for LIDO
 o Graphical ORder TOol

 o FunnelWeb User's Manual

 o Pattern-based Text Generator
 o Property Definition Language
 o Operator Identification Language
 o Tree Grammar Specification Language
 o Command Line Processing
 o COLA Options Reference Manual

 o Generating Unparsing Code

 o Monitoring a Processor's Execution

Administration

 o System Administration Guide

Mail Home

New Features of Eli Version 4.4

Previous Chapter Next Chapter Table of Contents


Using anything to access information

A Table is a sparse memory with a 32-bit address space (see Mapping Arbitrary Values To Definition Table Keys of Abstract data types to be used in specifications). Each element of the memory contains a DefTableKey value. This memory is used to implement a mapping from values of some arbitrary type to definition table keys, allowing an arbitrary set of properties to be associated with each value.

Any number of named tables can be instantiated, each with a specific type of value to be mapped. More than one table can map any given type of value. When a table is initialized, the user must provide two functions. One computes a 32-bit address from the value to be mapped, the other determines whether two values of the type to be mapped are identical. The first of these two functions often uses a general hashing operation (see Computing a Hash Value of Solutions of Common Problems).


Previous Chapter Next Chapter Table of Contents