previous				contents				next

1. Elements of the Mimi/E Language

1.1 Mimi/E as a Declarative Language

1.2 Entities and Data Types

1.3 Instantiation and Assignment of Variables

1.4 How Mimi Compares Numbers

1.5 Statements

1.6 Rules, Rule Sets and Predicates

1.7 Calling Mechanism for Predicates

2. How the Mimi Interpreter Works

2.1 Example Rule and its Procedural Analogue

2.2 Branch Structure of a Rule

2.3 Traversing the Tree

2.4 Backtracking

2.5 Automating Traversal of the Tree

2.6 IN and While Loops

How Loops Behave

Technical Details

BREAK Statements and UNKNOWN

Summary

2.7 OR Blocks

3. Writing Procedural Code using Mimi

3.1 Preventing Backtracking

3.2 Writing Code for a Series of Tests

3.3 General Principles for Writing Loops

IN Loops

WHILE Loops

3.4 Jumping Out of a Loop

Ignoring the Problem and Letting the Rule End UNKNOWN

Using a Delayed BREAK

"Proper Mimi" Approach

Recommendations

4. Advanced Programming Topics

4.1 Use of the Internal Set Index

4.2 Fail-safe Coding

4.3 Static and Dynamic References

4.4 Mixed Case Strings and Embedded Blanks in Rule Variables

4.5 Setting Up &Variables

4.6 Using &Variables

4.7 Replacing Mimi Commands with Your Own

4.8 Recursion

previous				contents				next