Information for "Shunting yard algorithm"

Jump to navigation Jump to search

Basic information

Display titleShunting yard algorithm
Default sort keyShunting yard algorithm
Page length (in bytes)13,392
Namespace ID0
Page ID2692773
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of page watchers127
Number of page watchers who visited in the last 30 days5
Number of redirects to this page1
Counted as a content pageYes
Wikidata item IDQ1199602
Local descriptionAlgorithm to parse a syntax with infix notation to postfix notation
Central descriptionstack-based algorithm for parsing infix mathematical expression, invented by Dijkstra
Page views in the past 30 days

Page protection

EditAllow all users (no expiry set)
MoveAllow all users (no expiry set)
View the protection log for this page.

Edit history

Page creatorKeenan Pepper (talk | contribs)
Date of page creation03:05, 17 September 2005
Latest editorWikiCleanerBot (talk | contribs)
Date of latest edit19:19, 9 October 2024
Total number of edits438
Recent number of edits (within past 30 days)2
Recent number of distinct authors2

Page properties

Hidden categories (4)

This page is a member of 4 hidden categories (help):

Transcluded templates (73)

Pages transcluded onto the current version of this page (help):

Wikidata entities used in this page

External tools