Stack-Oriented Programming Language: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ", [[" to ", [[") |
m (Text replacement - "==References==" to "== References ==") |
||
| Line 5: | Line 5: | ||
---- | ---- | ||
---- | ---- | ||
==References== | == References == | ||
=== 2018 === | === 2018 === | ||
Revision as of 22:38, 15 October 2018
A Stack-Oriented Programming Language is a programming language that relies on a stack machine model for passing parameters.
- Example(s):
- See: Infix Notation, RPL (Programming Language), PostScript, BibTeX, Assembly Language, Stack (Data Structure), Reverse Polish Notation.
References
2018
- (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).
- 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).
- ↑ Oren Patashnik. Designing BibTeX styles. http://www.ctan.org/tex-archive/info/biblio/bibtex/contrib/doc/btxhak.pdf.