c# Postfix to Tree structure with grouping Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
How come Sam didn't become Lord of Horn Hill?
Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?
How to compare two different files line by line in unix?
What do you call the main part of a joke?
Crossing US/Canada Border for less than 24 hours
How to tell that you are a giant?
Wu formula for manifolds with boundary
Why are the trig functions versine, haversine, exsecant, etc, rarely used in modern mathematics?
Do jazz musicians improvise on the parent scale in addition to the chord-scales?
Why are both D and D# fitting into my E minor key?
Amount of permutations on an NxNxN Rubik's Cube
First console to have temporary backward compatibility
Why do we bend a book to keep it straight?
Did MS DOS itself ever use blinking text?
Is "Reachable Object" really an NP-complete problem?
Do I really need recursive chmod to restrict access to a folder?
Delete nth line from bottom
Is it cost-effective to upgrade an old-ish Giant Escape R3 commuter bike with entry-level branded parts (wheels, drivetrain)?
Why didn't Eitri join the fight?
8 Prisoners wearing hats
What is the longest distance a player character can jump in one leap?
What is homebrew?
How to Make a Beautiful Stacked 3D Plot
Around usage results
c# Postfix to Tree structure with grouping
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
I'm not good at English.
It's gonna be hard to read.
I apologize in advance.
I need expression parser for draw diagram(fault tree).
A1 AND A2 AND ( A3 OR A4 ) AND ( A5 OR A6 ) AND A7
The above example was written roughly as I thought.
and convert to postfix.
postfix to hierarchy
private static List<Token> ToHierarchy(List<Token> tokenList)
Stack<Token> stack = new Stack<Token>();
foreach (Token token in tokenList)
token.Type == TokenType.OrGate)
if( certain condition )
grouping
else
Token left = stack.Pop();
Token right = stack.Pop();
List<Token> list = new List<Token>();
list.Insert(0, left);
list.Insert(0, right);
left.Parent = token;
right.Parent = token;
token.Children = list;
stack.Push(token);
else
stack.Push(token);
return stack.ToList();
Results from above code(looks like binary tree)
The results I need
c# parsing lexer
asked 2 mins ago
theccothecco
93
$endgroup$
add a comment |
$begingroup$
I'm not good at English.
It's gonna be hard to read.
I apologize in advance.
I need expression parser for draw diagram(fault tree).
A1 AND A2 AND ( A3 OR A4 ) AND ( A5 OR A6 ) AND A7
The above example was written roughly as I thought.
and convert to postfix.
postfix to hierarchy
private static List<Token> ToHierarchy(List<Token> tokenList)
Stack<Token> stack = new Stack<Token>();
foreach (Token token in tokenList)
token.Type == TokenType.OrGate)
if( certain condition )
grouping
else
Token left = stack.Pop();
Token right = stack.Pop();
List<Token> list = new List<Token>();
list.Insert(0, left);
list.Insert(0, right);
left.Parent = token;
right.Parent = token;
token.Children = list;
stack.Push(token);
else
stack.Push(token);
return stack.ToList();
Results from above code(looks like binary tree)
The results I need
c# parsing lexer
asked 2 mins ago
theccothecco
93
$endgroup$
add a comment |
$begingroup$
I'm not good at English.
It's gonna be hard to read.
I apologize in advance.
I need expression parser for draw diagram(fault tree).
A1 AND A2 AND ( A3 OR A4 ) AND ( A5 OR A6 ) AND A7
The above example was written roughly as I thought.
and convert to postfix.
postfix to hierarchy
private static List<Token> ToHierarchy(List<Token> tokenList)
Stack<Token> stack = new Stack<Token>();
foreach (Token token in tokenList)
token.Type == TokenType.OrGate)
if( certain condition )
grouping
else
Token left = stack.Pop();
Token right = stack.Pop();
List<Token> list = new List<Token>();
list.Insert(0, left);
list.Insert(0, right);
left.Parent = token;
right.Parent = token;
token.Children = list;
stack.Push(token);
else
stack.Push(token);
return stack.ToList();
Results from above code(looks like binary tree)
The results I need
c# parsing lexer
asked 2 mins ago
theccothecco
93
$endgroup$
I'm not good at English.
It's gonna be hard to read.
I apologize in advance.
I need expression parser for draw diagram(fault tree).
A1 AND A2 AND ( A3 OR A4 ) AND ( A5 OR A6 ) AND A7
The above example was written roughly as I thought.
and convert to postfix.
postfix to hierarchy
private static List<Token> ToHierarchy(List<Token> tokenList)
Stack<Token> stack = new Stack<Token>();
foreach (Token token in tokenList)
token.Type == TokenType.OrGate)
if( certain condition )
grouping
else
Token left = stack.Pop();
Token right = stack.Pop();
List<Token> list = new List<Token>();
list.Insert(0, left);
list.Insert(0, right);
left.Parent = token;
right.Parent = token;
token.Children = list;
stack.Push(token);
else
stack.Push(token);
return stack.ToList();
Results from above code(looks like binary tree)
The results I need
c# parsing lexer
c# parsing lexer
asked 2 mins ago
theccothecco
93
asked 2 mins ago
theccothecco
93
asked 2 mins ago
theccothecco
93
asked 2 mins ago
theccothecco
93
asked 2 mins ago
theccothecco
93
93
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
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',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217656%2fc-postfix-to-tree-structure-with-grouping%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217656%2fc-postfix-to-tree-structure-with-grouping%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
