# Let's Build A Simple Interpreter. Part 11.

DevFeed: [Let's Build A Simple Interpreter. Part 11.](<https://devfeed.tech/articles/let-s-build-a-simple-interpreter-part-11-33314.md>)

Original publisher: [Read original article](<https://ruslanspivak.com/lsbasi-part11/>)

Author: Ruslan Spivak

Published: 2016-09-21T01:15:00Z

Content type: tutorial

Language: en

Sources: [Ruslan Spivak](<https://devfeed.tech/sources/ruslan-spivak.md>)

Topics: [Parsing](<https://devfeed.tech/topics/parsing.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [blog](<https://devfeed.tech/tags/blog.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [lexer](<https://devfeed.tech/tags/lexer.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [recursive-descent-parser](<https://devfeed.tech/tags/recursive-descent-parser.md>), [tokens](<https://devfeed.tech/tags/tokens.md>)

## AI overview

Part 11 recaps how to build an interpreter by performing lexical analysis, parsing, grammar mapping, recursive-descent parsing, AST construction and traversal, and interpretation of a complete Pascal program. It previews nested procedures and functions, semantic analysis, and control flow.

## Source excerpt

I was sitting in my room the other day and thinking about how much we had covered, and I thought I would recap what we've learned so far and what lies ahead of us. Up until now we've learned: How to break sentences into tokens. The process is ...