Pancake Stack

This page is a work in progress

Pancake Stack is a stack-based esoteric programming language created by User:JWinslow23 in 2013, in which programs require you to manipulate a stack of pancakes.

Syntax
The pancake stack starts out as empty.

Hello World!
Put this heavenly pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put syrup on the pancakes! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Show me a pancake! Put this appetizing pancake on top! Put this delectable pancake on top! Put this delicious pancake on top! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Show me a pancake! Put this wonderful pancake on top! Take off the syrup! Put the top pancakes together! Show me a pancake! Show me a pancake! Put this rich pancake on top! Take off the butter! Put the top pancakes together! Show me a pancake! Put this delightful pancake on top! Put this dainty pancake on top! Put the top pancakes together! Put another pancake on top! Put the top pancakes together! Show me a pancake! Put this tasty pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put another pancake on top! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Put the top pancakes together! Show me a pancake! Eat the pancake on top! Show me a pancake! Put this good pancake on top! Take off the butter! Put the top pancakes together! Show me a pancake! Put this divine pancake on top! Flip the pancakes on top! Take from the top pancakes! Show me a pancake! Put this pleasant pancake on top! Flip the pancakes on top! Take from the top pancakes! Show me a pancake! Put this mouthwatering pancake on top! Put this scrumptious pancake on top! Put this enjoyable pancake on top! Put the top pancakes together! Put the top pancakes together! Show me a pancake! Eat all of the pancakes!

Cat program
Put this old pancake on top! [CAT] Eat the pancake on top! Give me a pancake! Show me a pancake! If the pancake is tasty, go over to "CAT". Eat all of the pancakes!

This is for numeric input. For ASCII input, replace "Give me a pancake!" with "How about a hotcake?"

Computational class
Pancake Stack is Turing complete assuming stack values are unbounded, as it can easily simulate a two-register Minsky machine using the top two stack values as registers.

Alternatively, if stack values are bounded, then Pancake Stack is not Turing complete, as it can be simulated by a push-down automaton. Some trick is needed to support incrementing/decrementing all values simultaneously, e.g. one could keep track of a separate value (in the automaton state) to be implicitly added to all stack values.

Implementations
http://ideone.com/7sFFo0