LC

Implement Simple Stack with PUSH and POP Instructions

medium6/10

Add Branch Instructions: JMP, JEQ, JGT Add CALL and RET Support for Subroutines

Language

Compiler

2.0s Limit 256MB

Implementation

Implement stack with PUSH and POP instructions.

Requirements:

Add stack pointer (SP) register
Implement PUSH instruction (decrement SP, store value)
Implement POP instruction (load value, increment SP)
Check for stack overflow/underflow
Test PUSH and POP operations
Verify LIFO behavior
Show stack contents

Why This Matters

The PUSH/POP/SP mechanics you implement here are exactly what x86's RSP register and ARM's SP do on every function call, and stack-based buffer overflows, one of the most exploited vulnerability classes in CVE history, happen precisely because this LIFO memory can be overwritten past its bounds. Stack canaries and non-executable-stack protections in glibc and the Linux kernel exist specifically to defend this structure.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0