How to parse recursive parentheses correctly?












2














I need to parse a string that contains some parentheses disposed recursively, but i'm having trouble with determining priority of parentheses.
For exemple, I have the string



$truth = "((A^¬B)->C)";


and I need to return what is between the parentheses. I've already done it with the following regex:



preg_match_all("~((.*?))~", $truth, $str);


But the problem is that it returns what is between the first "(" and the first ")", which is




(A^¬B




Instead of this, i need it to 'know' where the parentheses closes correctly, in order to return




(A^¬B)->C




How can I return this respecting the priority order? Thanks!






php regex







share|improve this question
























  • You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
    – Havenard
    Nov 11 at 1:43












  • Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
    – Ralph Ritoch
    Nov 11 at 1:46
















2














I need to parse a string that contains some parentheses disposed recursively, but i'm having trouble with determining priority of parentheses.
For exemple, I have the string



$truth = "((A^¬B)->C)";


and I need to return what is between the parentheses. I've already done it with the following regex:



preg_match_all("~((.*?))~", $truth, $str);


But the problem is that it returns what is between the first "(" and the first ")", which is




(A^¬B




Instead of this, i need it to 'know' where the parentheses closes correctly, in order to return




(A^¬B)->C




How can I return this respecting the priority order? Thanks!






php regex







share|improve this question
























  • You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
    – Havenard
    Nov 11 at 1:43












  • Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
    – Ralph Ritoch
    Nov 11 at 1:46














2












2








2


1





I need to parse a string that contains some parentheses disposed recursively, but i'm having trouble with determining priority of parentheses.
For exemple, I have the string



$truth = "((A^¬B)->C)";


and I need to return what is between the parentheses. I've already done it with the following regex:



preg_match_all("~((.*?))~", $truth, $str);


But the problem is that it returns what is between the first "(" and the first ")", which is




(A^¬B




Instead of this, i need it to 'know' where the parentheses closes correctly, in order to return




(A^¬B)->C




How can I return this respecting the priority order? Thanks!






php regex







share|improve this question















I need to parse a string that contains some parentheses disposed recursively, but i'm having trouble with determining priority of parentheses.
For exemple, I have the string



$truth = "((A^¬B)->C)";


and I need to return what is between the parentheses. I've already done it with the following regex:



preg_match_all("~((.*?))~", $truth, $str);


But the problem is that it returns what is between the first "(" and the first ")", which is




(A^¬B




Instead of this, i need it to 'know' where the parentheses closes correctly, in order to return




(A^¬B)->C




How can I return this respecting the priority order? Thanks!






php regex




php regex






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 11 at 1:37









Nick

22.8k81535




22.8k81535










asked Nov 11 at 1:22









Nicholas Ferreira

284




284












  • You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
    – Havenard
    Nov 11 at 1:43












  • Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
    – Ralph Ritoch
    Nov 11 at 1:46


















  • You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
    – Havenard
    Nov 11 at 1:43












  • Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
    – Ralph Ritoch
    Nov 11 at 1:46
















You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
– Havenard
Nov 11 at 1:43






You could just make an exclusion group and match anything but parenthesis with [^()]* instead of .*, but you might probably still run into problems depending on the complexity of the expression you're trying to parse, specially if it's malformed. Regular expressions are handy but they don't apply to every parsing problem.
– Havenard
Nov 11 at 1:43














Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
– Ralph Ritoch
Nov 11 at 1:46




Regular expressions are not adequate for parsing a language. Try a parser generator. stackoverflow.com/questions/3720362/…
– Ralph Ritoch
Nov 11 at 1:46












2 Answers
2






active

oldest

votes


















3














The main problem you have right now is the ? non-greedy bit. If you change that to just .+ greedy it will match what you want. 



$truth = "((A^¬B)->C)";

preg_match('/(.+)/', $truth, $match);


Try it



Output



(A^¬B)->C


If you want to match the inner pair you can use a recursive subpattern:



$truth = "((A^¬B)->C)";

preg_match('/(([^()]+|(?0)))/', $truth, $match);


Try It online



Output



A^¬B


If you need to go further then that you can make a lexer/parser. I have some examples here:



https://github.com/ArtisticPhoenix/MISC/tree/master/Lexers






share|improve this answer























  • Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
    – Nicholas Ferreira
    Nov 11 at 2:14










  • Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
    – ArtisticPhoenix
    Nov 11 at 2:31










  • @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
    – Nick
    Nov 11 at 3:50










  • Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
    – ArtisticPhoenix
    Nov 11 at 3:53



















3














For your sample string, something like this will recursively give you the contents of the parentheses. It works by forcing the parentheses matched to be the outermost pair by using ^[^(]* and [^)]*$ at each end of the regex.



$truth = "((A^¬B)->C)";

while (strpos($truth, '(') !== false) {

    preg_match("~^[^(]*((.*?))[^)]*$~", $truth, $str);

    $truth = $str[1];

    echo "$truthn";

}


Output



(A^¬B)->C 

A^¬B


Note however this will not correctly parse a string such as (A+B)-(C+D). If that could be your scenario, this answer might help.



Demo on 3v4l.org






share|improve this answer























    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: "1"
    };
    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: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245032%2fhow-to-parse-recursive-parentheses-correctly%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3














    The main problem you have right now is the ? non-greedy bit. If you change that to just .+ greedy it will match what you want. 



    $truth = "((A^¬B)->C)";
    
preg_match('/(.+)/', $truth, $match);


    Try it



    Output



    (A^¬B)->C


    If you want to match the inner pair you can use a recursive subpattern:



    $truth = "((A^¬B)->C)";
    
preg_match('/(([^()]+|(?0)))/', $truth, $match);


    Try It online



    Output



    A^¬B


    If you need to go further then that you can make a lexer/parser. I have some examples here:



    https://github.com/ArtisticPhoenix/MISC/tree/master/Lexers






    share|improve this answer























    • Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
      – Nicholas Ferreira
      Nov 11 at 2:14










    • Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
      – ArtisticPhoenix
      Nov 11 at 2:31










    • @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
      – Nick
      Nov 11 at 3:50










    • Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
      – ArtisticPhoenix
      Nov 11 at 3:53
















    3














    The main problem you have right now is the ? non-greedy bit. If you change that to just .+ greedy it will match what you want. 



    $truth = "((A^¬B)->C)";
    
preg_match('/(.+)/', $truth, $match);


    Try it



    Output



    (A^¬B)->C


    If you want to match the inner pair you can use a recursive subpattern:



    $truth = "((A^¬B)->C)";
    
preg_match('/(([^()]+|(?0)))/', $truth, $match);


    Try It online



    Output



    A^¬B


    If you need to go further then that you can make a lexer/parser. I have some examples here:



    https://github.com/ArtisticPhoenix/MISC/tree/master/Lexers






    share|improve this answer























    • Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
      – Nicholas Ferreira
      Nov 11 at 2:14










    • Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
      – ArtisticPhoenix
      Nov 11 at 2:31










    • @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
      – Nick
      Nov 11 at 3:50










    • Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
      – ArtisticPhoenix
      Nov 11 at 3:53














    3












    3








    3






    The main problem you have right now is the ? non-greedy bit. If you change that to just .+ greedy it will match what you want. 



    $truth = "((A^¬B)->C)";
    
preg_match('/(.+)/', $truth, $match);


    Try it



    Output



    (A^¬B)->C


    If you want to match the inner pair you can use a recursive subpattern:



    $truth = "((A^¬B)->C)";
    
preg_match('/(([^()]+|(?0)))/', $truth, $match);


    Try It online



    Output



    A^¬B


    If you need to go further then that you can make a lexer/parser. I have some examples here:



    https://github.com/ArtisticPhoenix/MISC/tree/master/Lexers






    share|improve this answer














    The main problem you have right now is the ? non-greedy bit. If you change that to just .+ greedy it will match what you want. 



    $truth = "((A^¬B)->C)";
    
preg_match('/(.+)/', $truth, $match);


    Try it



    Output



    (A^¬B)->C


    If you want to match the inner pair you can use a recursive subpattern:



    $truth = "((A^¬B)->C)";
    
preg_match('/(([^()]+|(?0)))/', $truth, $match);


    Try It online



    Output



    A^¬B


    If you need to go further then that you can make a lexer/parser. I have some examples here:



    https://github.com/ArtisticPhoenix/MISC/tree/master/Lexers







    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited Nov 11 at 2:02

























    answered Nov 11 at 1:56









    ArtisticPhoenix

    15.1k11223




    15.1k11223












    • Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
      – Nicholas Ferreira
      Nov 11 at 2:14










    • Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
      – ArtisticPhoenix
      Nov 11 at 2:31










    • @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
      – Nick
      Nov 11 at 3:50










    • Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
      – ArtisticPhoenix
      Nov 11 at 3:53


















    • Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
      – Nicholas Ferreira
      Nov 11 at 2:14










    • Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
      – ArtisticPhoenix
      Nov 11 at 2:31










    • @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
      – Nick
      Nov 11 at 3:50










    • Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
      – ArtisticPhoenix
      Nov 11 at 3:53
















    Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
    – Nicholas Ferreira
    Nov 11 at 2:14




    Thanks! It solved my problem. And thanks to the others too, it will be useful. =D
    – Nicholas Ferreira
    Nov 11 at 2:14












    Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
    – ArtisticPhoenix
    Nov 11 at 2:31




    Sure I just added my output converter to my website, artisticphoenix.com/2018/11/11/output-converter it uses the same parsing idea but can convert var_export and print_r to usable arrays. Something I have to do a lot on here... lol
    – ArtisticPhoenix
    Nov 11 at 2:31












    @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
    – Nick
    Nov 11 at 3:50




    @ArtisticPhoenix I was just thinking I was going to have to write the same tool myself! Thanks for sharing...
    – Nick
    Nov 11 at 3:50












    Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
    – ArtisticPhoenix
    Nov 11 at 3:53




    Sure, My site is still a work in progress. lol. I don't get a lot of time to work on it unfortunately
    – ArtisticPhoenix
    Nov 11 at 3:53













    3














    For your sample string, something like this will recursively give you the contents of the parentheses. It works by forcing the parentheses matched to be the outermost pair by using ^[^(]* and [^)]*$ at each end of the regex.



    $truth = "((A^¬B)->C)";
    
while (strpos($truth, '(') !== false) {
    
    preg_match("~^[^(]*((.*?))[^)]*$~", $truth, $str);
    
    $truth = $str[1];
    
    echo "$truthn";
    
}


    Output



    (A^¬B)->C 
    
A^¬B


    Note however this will not correctly parse a string such as (A+B)-(C+D). If that could be your scenario, this answer might help.



    Demo on 3v4l.org






    share|improve this answer




























      3














      For your sample string, something like this will recursively give you the contents of the parentheses. It works by forcing the parentheses matched to be the outermost pair by using ^[^(]* and [^)]*$ at each end of the regex.



      $truth = "((A^¬B)->C)";
      
while (strpos($truth, '(') !== false) {
      
    preg_match("~^[^(]*((.*?))[^)]*$~", $truth, $str);
      
    $truth = $str[1];
      
    echo "$truthn";
      
}


      Output



      (A^¬B)->C 
      
A^¬B


      Note however this will not correctly parse a string such as (A+B)-(C+D). If that could be your scenario, this answer might help.



      Demo on 3v4l.org






      share|improve this answer


























        3












        3








        3






        For your sample string, something like this will recursively give you the contents of the parentheses. It works by forcing the parentheses matched to be the outermost pair by using ^[^(]* and [^)]*$ at each end of the regex.



        $truth = "((A^¬B)->C)";
        
while (strpos($truth, '(') !== false) {
        
    preg_match("~^[^(]*((.*?))[^)]*$~", $truth, $str);
        
    $truth = $str[1];
        
    echo "$truthn";
        
}


        Output



        (A^¬B)->C 
        
A^¬B


        Note however this will not correctly parse a string such as (A+B)-(C+D). If that could be your scenario, this answer might help.



        Demo on 3v4l.org






        share|improve this answer














        For your sample string, something like this will recursively give you the contents of the parentheses. It works by forcing the parentheses matched to be the outermost pair by using ^[^(]* and [^)]*$ at each end of the regex.



        $truth = "((A^¬B)->C)";
        
while (strpos($truth, '(') !== false) {
        
    preg_match("~^[^(]*((.*?))[^)]*$~", $truth, $str);
        
    $truth = $str[1];
        
    echo "$truthn";
        
}


        Output



        (A^¬B)->C 
        
A^¬B


        Note however this will not correctly parse a string such as (A+B)-(C+D). If that could be your scenario, this answer might help.



        Demo on 3v4l.org







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Nov 11 at 2:12

























        answered Nov 11 at 1:37









        Nick

        22.8k81535




        22.8k81535






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • 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.


            To learn more, see our tips on writing great answers.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245032%2fhow-to-parse-recursive-parentheses-correctly%23new-answer', 'question_page');
            }
            );

            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







            -

            這個網誌中的熱門文章

            Xamarin.form Move up view when keyboard appear

            圖片
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 I'm trying to build a Chat app UI, the idea of the Layout was pretty simple: When the input bar is focused, keyboard show up and "push" up the chat bar, as it's a grid, the ListView will resize to fit the screen: I update the input bar's margin to "push" it up: NSValue result = (NSValue)args.Notification.UserInfo.ObjectForKey(new NSString(UIKeyboard.FrameEndUserInfoKey)); CGSize keyboardSize = result.RectangleFValue.Size; if (Element != null){ Element.Margin = new Thickness(0, 0, 0,keyboardSize.Height); //push the entry up to keyboard height when keyboard is activated } And this is ...
            閱讀完整內容

            Post-Redirect-Get with Spring WebFlux and Thymeleaf

            圖片
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 Can someone explain to me how to implement the post-redirect-get pattern in Spring WebFlux and Thymeleaf? What subscribes on the database save method? @GetMapping("/register") public String showRegisterForm(Model model) { model.addAttribute("user", new User()); return "register"; } @PostMapping public String processRegisterForm(@Valid User user, BindingResult bindingResult) { if (bindingResult.hasErrors()) { return "register"; } else { userRepository.save(user); //what subscribes on this? //how to redirect on e.g. "/login"? ...
            閱讀完整內容

            Anylogic : not able to use stopDelay()

            圖片
            -2 I am building a railway station model. I want a train to depart when I click a button. I want to call stopDelay() for that but I am not sure how to do that and from which place. anylogic share | improve this question asked Nov 23 '18 at 10:12 Anupam Singh Anupam Singh 1 Hi Anupam, welcome to SOF. Please check how to ask good questions, see link below. Your question is...
            閱讀完整內容