Anonymous user
Talk:Exponentiation order: Difference between revisions
→Task necessary?: addec comments concerning finding a computer language(s) associativity rules.
(→Functions: other examples...) |
(→Task necessary?: addec comments concerning finding a computer language(s) associativity rules.) |
||
Line 19:
The task [[Operator precedence]] which lists all the precedence and associativity rules for a language exists already. Since the order of "chained" exponentiations is simply determined by the associativity of the exponentiation operator I don't think this task adds any new information. --[[User:AndiPersti|Andreas Perstinger]] ([[User talk:AndiPersti|talk]]) 22:49, 23 March 2014 (UTC)
: I understand the most computer languages have associativity rules, but not all rules are easy to find (if at all) for all languages (see above for such an example). One reason for tasks in Rosetta Code is to find the differences between computer languages in solving (or executing) different tasks. There shouldn't have to be a need to do research in a computer language's documentation to find out the differences. Not all associative rules (for multiple computer languages) are obvious or that easy to find. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:38, 23 March 2014 (UTC)
| |||