From 01445f98c27722b2b4cd11aa03523cb42482bbb8 Mon Sep 17 00:00:00 2001 From: d3v Date: Sat, 19 Oct 2019 04:14:28 -0300 Subject: [PATCH] Create README.md --- README.md | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..22a4ece --- /dev/null +++ b/README.md @@ -0,0 +1,35 @@ +# calclog + +[![image]][repo] + + +[![license-badge]][license] + +Boolean calculator written in C# that implements Djikstra's Shunting Yard algorithm and RPN (reverse polish notation), see [**preview**][video] it on YouTube. + +Feel free to star this repository if you think its useful for you :smile: ! + +## References: +1. "Evaluate a boolean expression represented as string", see [reference][ref-1]; +1. "Logical connective", see [reference][ref-2]; +1. "Complete Character List for UTF-8", see [reference][ref-3]; +1. "UTF-8 encoding table and Unicode characters", see [reference][ref-4]; +1. "List of logic symbols", see [reference][ref-5]; +1. "The Shunting Yard Algorithm", see [reference][ref-6]; +1. "Truth Table Generator", see [reference][ref-7]; +1. "C# realization of Shunting-yard algorithm", see [reference][ref-8]; + +[image]: /logo.png +[repo]: https://github.com/Devwarlt/calclog +[license]: /LICENSE +[license-badge]: https://img.shields.io/badge/License-MIT-yellow.svg +[video]: https://youtu.be/5wLCEDuSyEo + +[ref-1]: https://www.geeksforgeeks.org/evaluate-a-boolean-expression-represented-as-string/ +[ref-2]: https://en.wikipedia.org/wiki/Logical_connective +[ref-3]: http://www.fileformat.info/info/charset/UTF-8/list.htm +[ref-4]: https://www.utf8-chartable.de/unicode-utf8-table.pl?number=1024&names=-&utf8=- +[ref-5]: https://en.wikipedia.org/wiki/List_of_logic_symbols +[ref-6]: http://math.oxford.emory.edu/site/cs171/shuntingYardAlgorithm/ +[ref-7]: https://github.com/bruceoutdoors/TTGen +[ref-8]: https://gist.github.com/istupakov/c49ef290c3bc3dbe329bf68f67971470