Lecture overview -- Keyboard shortcut: 'u'  Previous page: List processing -- Keyboard shortcut: 'p'  Next page: Tree processing (2) -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Help page about these notes  Alphabetic index  Course home    Lecture 3 - Page 18 : 42
Functional Programming in Scheme
Name binding, Recursion, Iteration, and Continuations
Tree processing (1)

A tree is a recursive data structure

We illustrate how to extract information from an HTML syntax tree

y:/Kurt/Files/courses/prog3/prog3-03/sources/notes/includes/ast-example.lamlA sample web document with a number of links.

The link forms - represented by a elements - are highlighted.

y:/Kurt/Files/courses/prog3/prog3-03/sources/notes/includes/ast-ast-example.lspThe abstract syntax tree represented as nested lists.

It is hard to read and understand this representation of the tree structure. It is not really oriented towards human reading.

The syntax tree of the web document with the root made up by the html element.