Anonymous user
Talk:Truth table: Difference between revisions
→Incorrect example
(→Incorrect example: Help?) |
|||
Line 27:
:Hi Gvx, I took a look and it seems that all three are incorrect for the same reason. You could look at the history of the page and find what the first few examples do, but in this case I think the task description does state that it wants the input of an expression to be parsed and evaluated. Some languages have that built-in; for others there is the hint of the mention of reverse-polish or infix evaluators.
:If marked incorrect (or left out completely), it signals that a correct examples is needed. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 08:00, 22 November 2013 (UTC)
:[[Parsing/RPN calculator algorithm|This]] might help. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 08:06, 22 November 2013 (UTC)
:: We could also mark the title of this task as incorrect, because what on earth has building a (not very robust) parser have to do with truth tables.[[User:Fwend|Fwend]] ([[User talk:Fwend|talk]]) 14:55, 22 November 2013 (UTC)
| |||