[Demo time.

Switch to IP. “simple.ip” should be open from before.

• Compile with “keep transform”
• Show statistics of transformed and original tree
• Show element structure and fields that were appended by the transformations
• Compile with “Functional”. Show transformed code
• Compile with “Persistent” (don’t forget annotation). Run to show how the items stored survive executions of the program
• Possibly show how “update” only generates code for the doubly linked list. The record is not removed and re-inserted in the other structures

Open “lrusim2.ip”. Explain that this is an example that is going to be discussed later. For now we just demonstrate design rule checking

• Add “array” layer in typex
• Add “goto_first”, “delete” operations for position_cursor
• Compile to show error messages

Open “hashtab.ip”. Compile with fast typex and run. Then compile with slow typex and run].