Making A Compiler: Difference between revisions

From bibbleWiki
Jump to navigation Jump to search
Line 21: Line 21:
==Abstract Syntax Tree==
==Abstract Syntax Tree==
==Continuation vs Recursion==
==Continuation vs Recursion==
===Original Implementation===
From the start we had recursion where we parse expression which in turn parses an expression.
===Next Implementation===
==Typical Flow Control==
==Typical Flow Control==
*Jump goto, while, functions
*Jump goto, while, functions

Revision as of 03:49, 7 October 2024

Introduction

This page is how someone went about build a compiler and is here for reference

Steps

  • Write example file
  • Read contents of file
  • Parse Lines
  • Parse Tokens in
  • Decide on Node Types
  • Decide what AST should look like
  • Create Nodes

Parsing Context

We made a context to store

  • type e.g. integers
  • variables e.g. a, b

Types

This is the storing of which types would be valid in our code

Variables

This is the storing of which variable are in our code. Against each variable we store which type and which variable e.g. a : integer = 69

Things I learnt

Abstract Syntax Tree

Continuation vs Recursion

Original Implementation

From the start we had recursion where we parse expression which in turn parses an expression.

Next Implementation

Typical Flow Control

  • Jump goto, while, functions
  • Conditional (if/then/else)
  • Early Exit (break, continue, skip)
  • Exception handling (try/throw/catch)
  • Lazy evaluation (delay/force)
  • Threading (thread create,stop, yield)
  • Generator (yield)