Is there a term equivalent to leaf node for parentheses grouping

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












I am trying to verbally describe how to evaluate a nested group of expressions. What would you call the most-interior group of parentheses as the expression is evaluated?



(((a-b)*(c+d)) - e)



In graph-theory this would be a leaf-node in the tree-representation of the expression. But I'm looking for a term that is not specific to graph-theory. The "next order of operation" comes to mind but that's not quite right, as I'm just looking at the parentheses grouping.



In the case above, I want to identify the most-interior groupings as (a-b) and (c+d). Is there a better way to refer to these other than "most-interior grouping" or leaf nodes of a tree graph?







share|cite|improve this question






















  • The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
    – Yves Daoust
    Aug 9 at 18:09







  • 1




    the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
    – Bram28
    Aug 9 at 18:16















up vote
0
down vote

favorite












I am trying to verbally describe how to evaluate a nested group of expressions. What would you call the most-interior group of parentheses as the expression is evaluated?



(((a-b)*(c+d)) - e)



In graph-theory this would be a leaf-node in the tree-representation of the expression. But I'm looking for a term that is not specific to graph-theory. The "next order of operation" comes to mind but that's not quite right, as I'm just looking at the parentheses grouping.



In the case above, I want to identify the most-interior groupings as (a-b) and (c+d). Is there a better way to refer to these other than "most-interior grouping" or leaf nodes of a tree graph?







share|cite|improve this question






















  • The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
    – Yves Daoust
    Aug 9 at 18:09







  • 1




    the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
    – Bram28
    Aug 9 at 18:16













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am trying to verbally describe how to evaluate a nested group of expressions. What would you call the most-interior group of parentheses as the expression is evaluated?



(((a-b)*(c+d)) - e)



In graph-theory this would be a leaf-node in the tree-representation of the expression. But I'm looking for a term that is not specific to graph-theory. The "next order of operation" comes to mind but that's not quite right, as I'm just looking at the parentheses grouping.



In the case above, I want to identify the most-interior groupings as (a-b) and (c+d). Is there a better way to refer to these other than "most-interior grouping" or leaf nodes of a tree graph?







share|cite|improve this question














I am trying to verbally describe how to evaluate a nested group of expressions. What would you call the most-interior group of parentheses as the expression is evaluated?



(((a-b)*(c+d)) - e)



In graph-theory this would be a leaf-node in the tree-representation of the expression. But I'm looking for a term that is not specific to graph-theory. The "next order of operation" comes to mind but that's not quite right, as I'm just looking at the parentheses grouping.



In the case above, I want to identify the most-interior groupings as (a-b) and (c+d). Is there a better way to refer to these other than "most-interior grouping" or leaf nodes of a tree graph?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 9 at 18:33

























asked Aug 9 at 18:04









SheepPlusPlus

11




11











  • The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
    – Yves Daoust
    Aug 9 at 18:09







  • 1




    the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
    – Bram28
    Aug 9 at 18:16

















  • The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
    – Yves Daoust
    Aug 9 at 18:09







  • 1




    the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
    – Bram28
    Aug 9 at 18:16
















The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
– Yves Daoust
Aug 9 at 18:09





The more I read the question, the less I understand it, sorry. In particular, the "next order of operation" is puzzling. What is the most-interior group of parentheses in your example ?
– Yves Daoust
Aug 9 at 18:09





1




1




the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
– Bram28
Aug 9 at 18:16





the most-interior group?! There are many such groups possible ... e.g. in your example, there are two
– Bram28
Aug 9 at 18:16
















active

oldest

votes











Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877531%2fis-there-a-term-equivalent-to-leaf-node-for-parentheses-grouping%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877531%2fis-there-a-term-equivalent-to-leaf-node-for-parentheses-grouping%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

Why am i infinitely getting the same tweet with the Twitter Search API?

Carbon dioxide