Timeline for Four-function expression evaluator
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 16, 2014 at 12:08 | comment | added | usr | You can test this through exhaustive testing: Generate all possible syntax trees of a given size, format them to a string and hand them to the parser. From the tree you already know the expected result. | |
| Jul 15, 2014 at 22:22 | answer | added | Aurelius | timeline score: 13 | |
| Jul 15, 2014 at 21:08 | vote | accept | Francis | ||
| Jul 15, 2014 at 20:46 | answer | added | Loki Astari | timeline score: 12 | |
| Jul 15, 2014 at 20:15 | comment | added | Loki Astari | Expression evaluators are a done to death problem. So there are well know good solutions. You are doing it the hard way. Here is an answer to a previous question that should handle expressions. codereview.stackexchange.com/a/54279/507 )note it reads expression from std::in but changing that should not be imposable. | |
| Jul 15, 2014 at 19:51 | comment | added | Francis | @Aurelius I am. I actually compile it using -std=c++11. | |
| Jul 15, 2014 at 19:03 | comment | added | Aurelius | Are you able to use C++11 features? I'm working on a (rather lengthy) answer, but some of the things I do require C++11. | |
| Jul 15, 2014 at 17:53 | history | tweeted | twitter.com/#!/StackCodeReview/status/489105372343717888 | ||
| Jul 15, 2014 at 16:54 | history | edited | Jamal | CC BY-SA 3.0 |
added 49 characters in body; edited title
|
| Jul 15, 2014 at 16:47 | review | First posts | |||
| Jul 15, 2014 at 16:53 | |||||
| Jul 15, 2014 at 16:42 | history | asked | Francis | CC BY-SA 3.0 |