GitHub - movzq/yard-algo: Shunting-yard algorithm implemented in C (Works for tokens that already have been parsed)

movzq / yard-algo Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Shunting-yard algorithm implemented in C (Works for tokens that already have been parsed)

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
Makefile		Makefile
readme		readme
yard-algo.c		yard-algo.c
yard-algo.h		yard-algo.h

Repository files navigation

yard-algo.
    Implementation of Shunting-yard algorithm created by "Edsger W. Dijkstra", this algorithm lets to any program
    parse a infix notation expression to a postfix notation, which is so helpful to solve arithemetic expressions,
    since that notations does not requiere the use of parentheses. The algorithm is already done for operations
    such as addition, subtraction, multiplication and division, but i'll be adding more to make it stronger ;).

    Resources:
    * https://mathcenter.oxford.emory.edu/site/cs171/shuntingYardAlgorithm/

    RIP Edsger W. Dijkstra.