Stack-Oriented Programming Language: Difference between revisions

Revision as of 01:21, 22 January 2018

Example(s):
- Forth (Programming Language).
See: Infix Notation, RPL (Programming Language), PostScript, BibTeX, Assembly Language, Stack (Data Structure), Reverse Polish Notation.

(Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Stack-oriented_programming_language Retrieved:2018-1-22.
- A stack-oriented programming language is one that relies on a stack machine model for passing parameters. Several programming languages fit this description, notably Forth, RPL, PostScript, BibTeX style design language ^[1] and many assembly languages (on a much lower level).
  Stack-oriented languages operate on one or more stacks, each of which may serve a different purpose. Thus, programming constructs in other programming languages may need to be modified for use in a stack-oriented system. Further, some stack-oriented languages operate in postfix or Reverse Polish notation, that is, any arguments or parameters for a command are stated before that command. For example, postfix notation would be written instead of (prefix or Polish notation), or (infix notation).

@@ Line 1: / Line 1: @@
+A [[Stack-Oriented Programming Language]] is a [[programming language]] that relies on a [[stack machine]] model for passing [[Parameter (computer programming)|parameters]].
-A [[Stack-Oriented Programming Language]] is a [[Stack Machine]] that ...
+* <B>Example(s):</B>
-* <B>See:</B> [[Infix Notation]], [[Stack Machine]], [[Parameter (Computer Programming)]], [[Forth (Programming Language)]], [[RPL (Programming Language)]], [[PostScript]], [[BibTeX]], [[Assembly Language]], [[Stack (Data Structure)]], [[Reverse Polish Notation]], [[Polish Notation]].
+** [[Forth (Programming Language)]].
+* <B>See:</B> [[Infix Notation]],  [[RPL (Programming Language)]], [[PostScript]], [[BibTeX]], [[Assembly Language]], [[Stack (Data Structure)]], [[Reverse Polish Notation]].
 ----
 ----