Jump to content

Talk:Exponentiation with infix operators in (or operating on) the base: Difference between revisions

m
m (→‎Title too confused and long: added some wording.)
Line 1:
==Title too confused and long==
 
Suggest work out an acceptable option and then change the task name. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 05:46, 3 November 2020 (UTC)
:Looks to me like the actual task is: "Demonstrate operator precedence" using exponentiation and unary negation as its required operators. I would propose "Operator precedence" as a task title... but that's just me. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 13:55, 3 November 2020 (UTC)
Line 12 ⟶ 13:
 
:Hi Gérard, how about "Exponentiation parsing" or "Infix parsed exponentiation" or some such as a re-title? Up to now I've not really been aware of the issue, so I'm learning stuff. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 17:22, 3 November 2020 (UTC)
 
:: Better to be long than inconcise. &nbsp; I was thinking: &nbsp; '''-n''' &nbsp; to me, is "in" the base, &nbsp; '''-(n)''' &nbsp; is acting "on" the base. &nbsp; &nbsp; Six of one, a half dozen of the other. &nbsp; &nbsp; If you don't mention the base, &nbsp; that might include such things like: &nbsp; &nbsp; '''x**-2'''. &nbsp; &nbsp; As I referred to, I saw examples of the use of infix operators on the <u>base</u> of an expression being exponentiated. &nbsp; I corrected one problem by added an appropriate set of parentheses to the expression to clarify what was being intended. &nbsp; I don't recall how (or if) the other two tasks were resolved/changed (or not). &nbsp; One has to be careful of changing Rosetta Code tasks that are no longer in draft status, don't you know?. &nbsp; It was easier for me to add a draft task addressing this specific issue rather than trying to correct an existing Rosetta Code task. &nbsp; I am learning that making changes to (establish) tasks on Rosetta Code, &nbsp; it's often better to ask forgiveness than ask permission. &nbsp; Take this Rosetta Code (draft) task in point. &nbsp; The point was to clarify how different computer programming languages deal with this issue, &nbsp; an infix operator that is acting on the &nbsp; ''base'' &nbsp; not the exponent, &nbsp; so that is why the Rosetta Code task has a longer (i.e., specific) name &nbsp; (to make it ... er, ... specific). &nbsp; &nbsp; &nbsp; By the way, the one Rosetta Code task's preamble that I did change, was in fact, an exponential expression &nbsp; '''raised''' &nbsp; to an exponential expression that had, in fact, an infix operator (within the 2<sup>nd</sup> exponential expression, ... or 3<sup>rd</sup>, depending how one counts expressions), &nbsp; the explanation almost makes your head spin) ─── I hope that I am recalling correctly, &nbsp; and I hope that it is clear as mud, &nbsp; but it covers the ground ─── &nbsp; &nbsp; which you might see why I thought it needed to be clarified. &nbsp; If I had asked, we still may be talking about that Rosetta Code task, and possibly, &nbsp; on why it didn't need to be changed as everyone (so far at that time) &nbsp; ''knew'' &nbsp; what was intended, &nbsp; or their computer programming language(s) used that version/meaning of the syntax, &nbsp; so it made that interpretation of the syntax moot. &nbsp; Everybody knows what I mean when I say, &nbsp; "let's go eat Grandma". &nbsp; &nbsp; Still, it's better, when writing, expressing it as: &nbsp; "let's go eat, Grandma". &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:41, 3 November 2020 (UTC)
 
==what should non infix languages do? ==
Cookies help us deliver our services. By using our services, you agree to our use of cookies.