Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 308395
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 12, 20262026-05-12T07:38:47+00:00 2026-05-12T07:38:47+00:00

I have this string: [a [a b] [c e f] d] and I want

  • 0

I have this string:

[a [a b] [c e f] d]

and I want a list like this

lst[0] = "a"
lst[1] = "a b"
lst[2] = "c e f"
lst[3] = "d"

My current implementation that I don’t think is elegant/pythonic is two recursive functions (one splitting with ‘[‘
and the other with ‘]’ ) but I am sure it can be
done using list comprehensions or regular expressions (but I can’t figure out a sane way to do it).

Any ideas?

  • 1 1 Answer
  • 5 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-12T07:38:47+00:00Added an answer on May 12, 2026 at 7:38 am

    Actually this really isn’t a recursive data structure, note that a and d are in separate lists. You’re just splitting the string over the bracket characters and getting rid of some white space.

    I’m sure somebody can find something cleaner, but if you want a one-liner something like the following should get you close:

    parse_str = '[a [a b] [c e f] d]'
    lst = [s.strip() for s in re.split('[\[\]]', parse_str) if s.strip()]
    
    >>>lst
    ['a', 'a b', 'c e f', 'd']
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a string that looks like this: 9/1/2009. I want to convert it
I have a List<string> that has some items like this: {"Pre Mdd LH", "Post
I have an ordered list like this: var list = new List<String>(){aaa,aab,aac,baa,bab,bac}; I want
I have string like this /c SomeText\MoreText Some Text\More Text\Lol SomeText I want to
I have a string like this A. rahul VyAs and i want to remove
I have string looking like this: 'Toy Story..(II) (1995)' I want to split the
I have a string of test like this: <customtag>hey</customtag> I want to use a
i have a prolog list like this: [p(X,Y,Z),r(H,G,K)] and i want convert it into
I have an ArrayList full of strings arrays that I built like this: String[]
I have a String that looks like this String read = 1130:5813|1293:5803|1300:5755|1187:5731| As you

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.