Stack-Oriented Programming Language: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "([^\s])([\s]{1,7})\<P\>" to "$1 <P>") |
m (Text replacement - "\<P\>([\s]{1,7})([^\s])" to "<P> $2") |
||
| Line 10: | Line 10: | ||
=== 2018 === | === 2018 === | ||
* (Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Stack-oriented_programming_language Retrieved:2018-1-22. | * (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 [[Parameter (computer programming)|parameters]]. Several programming languages fit this description, notably [[Forth (programming language)|Forth]], [[RPL (programming language)|RPL]], [[PostScript]], [[BibTeX]] style design language <ref> Oren Patashnik. Designing BibTeX styles. http://www.ctan.org/tex-archive/info/biblio/bibtex/contrib/doc/btxhak.pdf. </ref> and many [[assembly language]]s (on a much lower level). <P> | ** A '''stack-oriented programming language''' is one that relies on a [[stack machine]] model for passing [[Parameter (computer programming)|parameters]]. Several programming languages fit this description, notably [[Forth (programming language)|Forth]], [[RPL (programming language)|RPL]], [[PostScript]], [[BibTeX]] style design language <ref> Oren Patashnik. Designing BibTeX styles. http://www.ctan.org/tex-archive/info/biblio/bibtex/contrib/doc/btxhak.pdf. </ref> and many [[assembly language]]s (on a much lower level). <P> Stack-oriented languages operate on one or more [[Stack (data structure)|stack]]s, 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|''infix'' notation]]). | ||
<references/> | <references/> | ||
Revision as of 15:31, 19 August 2021
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.