Anonymous user
Talk:Exponentiation with infix operators in (or operating on) the base: Difference between revisions
Talk:Exponentiation with infix operators in (or operating on) the base (view source)
Revision as of 15:22, 3 November 2020
, 3 years ago→what should non infix languages do?: added wording.
(→what should non infix languages do?: added wording.) |
|||
Line 11:
==what should non infix languages do? ==
--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 05:46, 3 November 2020 (UTC)
: I might suggest they would add parenthesis or use whatever mechanism/method that would be most appropriate in that computer programming language. I say ''might'' as I have no idea what/how '''APL''' (and some other programming languages for instance) treat (or even has) infix operators. Take the case of: '''-4 + 6'''. Or, in the general case: '''-x''' (some operator) '''y''', where ''some operator'' may be a subset of what operators are supported for any one computer programming language. This was a problem that stopped me from adding '''REXX''' to a couple of Rosetta Code tasks because those tasks used '''\''' ('''not''', '''¬''', '''^''', '''~''', ''et al'') (and/or some other characters) in general expressions. '''PL/I''' and '''REXX''' (and I'm sure, others programming languaes as well) allow '''- 6 + - - 7''' (with or without the embedded blanks and/or the addition of grouping symbols [parentheses]) for instance, but multiple infix operators (and/or signs and/or logical '''nots''') wasn't the wide scope that I wanted to address for this Rosetta Code task. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 15:20, 3 November 2020 (UTC)
|