From 0b6ed9dc8c05c3bd2b39ee649a84b04c50792aec Mon Sep 17 00:00:00 2001 From: Arthur Paulino Date: Wed, 3 Jan 2018 15:29:39 -0300 Subject: [PATCH] Updated Basic Assembly tutorial (markdown) --- Basic-Assembly-tutorial.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/Basic-Assembly-tutorial.md b/Basic-Assembly-tutorial.md index dc850d2..e272e36 100644 --- a/Basic-Assembly-tutorial.md +++ b/Basic-Assembly-tutorial.md @@ -442,6 +442,4 @@ We use the term *push* when we add a piece of data on top of the stack and *pop* Visual representation of the stack: ![Visual representation of the stack](link to picture) -We can notice that this implementation of the stack is actually upside-down compared to a real-world stack of items: the stack grows downwards in memory, towards lower addresses. The important thing to remember is that the bottom of the stack is at a fixed address and that the top of the stack changes when an item is *pushed* on the stack or *popped* out. In the game's CPU, the **stack pointer** (SP) register always points to the top of the stack and the **base pointer** always points to the base of the current **stack frame** - -You can now take a look at the [assembly program examples](https://github.com/simon987/Much-Assembly-Required/wiki/Assembly-program-examples). \ No newline at end of file +We can notice that this implementation of the stack is actually upside-down compared to a real-world stack of items: the stack grows downwards in memory, towards lower addresses. The important thing to remember is that the bottom of the stack is at a fixed address and that the top of the stack changes when an item is *pushed* on the stack or *popped* out. In the game's CPU, the **stack pointer** (SP) register always points to the top of the stack and the **base pointer** always points to the base of the current **stack frame**. \ No newline at end of file