Eli   Documents

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 Scope Graphs
 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.8

Previous Chapter Next Chapter Table of Contents


Support for parsers not generated by Eli

Eli has the ability to generate a complete text processor, including all of the tree computation needed for contextual analysis. It assumes, however, that the input language can be described by a reasonably consistent grammar. This is not the always the case, even for programming languages, and it may be that more ad-hoc methods are needed to construct a tree that describes the source text.

There are many tools other than Eli that one can use to create processors that scan and parse text, and they differ among themselves in strategy and power. All support mechanisms to build trees on the basis of the relationships implicit in the input text. Once the tree is built, however, most systems provide no further aid. The user is responsible for writing code in C or Java to process and transform the tree.

Eli now has the ability to interact with a scanner/parser developed using any arbitrary technology (see Using Foreign parsers of Syntactic Analysis). For example, the "foreign" analyzer might be a collection of C or C++ routines that could be defined by a `specs' file and invoked by the main program that Eli generates. Alternatively, it might be a main program that invokes a shared library to build and process the tree. In either case, Eli can generate code to interact with it and automate the tedious job of constructing tree computations.


Previous Chapter Next Chapter Table of Contents