Talk:Stack-oriented programming: Difference between revisions

Content deleted Content added
Tags: Mobile edit Mobile app edit
Tags: Mobile edit Mobile app edit
Line 13:
:"A stack-oriented programming language is one that relies on a stack machine model for passing parameters"
 
That implies all nested block structure languages are stack orianted languages and doesn't distinguish the ones that actually have stack operators in the language. Stack orianted languages are aanalogous subset ofto stack based languaged. And passingPassing parameters on the call stack is not required.
 
It also excludes lenguages that do not have parameter. For example a language of functions that operate on a character stream (or string) and manipulates stacks directly.
Line 27:
num .. dgt dgt* MAKENUM();
</pre>
expr is a function who's goal is to first recognize a term. Then some number of term may be added to or subtracted from the first expresed by:
(('+':ADD|'-':SUB) term!2)*
The Kleene star is used to express that zero or more ('+' or '-' term) may follow.
Line 47:
The id and num '''..''' equation are token making euations. id catalogs the parsed characters in the dictionary creating a symbol object that is pushed in the parse stack. The num equation recognizes sequence of one or more dgt. MAKENUM() is a function call that intercepts the dictionary processing. It creates a numeric object from the dgt sequence and pushes it or the parse stack.
 
The SYNTAX language is a goal orianted, stack oriented, string processing language. <u>There are no parameters</u> on the call stack or any returned. Success ot failure is commonly a processor status state that can be tested using hardware branch on condition instructions. The parse and node stacks liken to global variables.
[[User:Steamerandy|Steamerandy]] ([[User talk:Steamerandy|talk]]) 22:42, 29 January 2016 (UTC)
 
== Program refinement ==