Stacked Brainfuck

This is brainfuck with the addition of a stack.

Commands
Stacked Brainfuck has the basic 8 commands.

The eight Basic language commands, each consisting of a single character:

There is also a  command, which serves the usual function of separating code and data.

11 Additional stack manipulation commands.

Hello World
+>+++++)<{)>==+++.=---.$=++..+++.<.)>)>(<_$=+++.>.)+++.(---._---.<<+.! Using preloaded data. (in reverse) [)>]([.(]!!dlroW olleH

Implementation
In the given implementation there are 65536 cells, each consisting of a single unsigned byte. The initial cell is at zero. The start of the stack is at the last cell. They grow towards each other (per usual). Cell's wrap (255 + 1 = 0; 0 - 1 = 255). Attempting to decrement from the initial cell causes no decremention.

SBFCPP.cpp

Computational class
Stacked Brainfuck is obviously not Turing-complete, as it has bounded storage.

An alternative implementation to allow turing-completeness is to place the stack in negative cells below zero, or to separate it completely.