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 6227957
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T09:18:23+00:00 2026-05-24T09:18:23+00:00

I’m trying to write a LEPL grammar to describe a Boolean search language. This

  • 0

I’m trying to write a LEPL grammar to describe a Boolean search language. This is what I have so far:

from lepl import *
text = String() | Word()
tail = ~Lookahead('AND') & ~Lookahead('OR') & text
with DroppedSpace():
    andClause = (tail & Lookahead('AND') & Drop('AND') & tail)[1:] > tuple
    orClause = (tail & Lookahead('OR') & Drop('OR') & tail)[1:] > list
    andOrText = (andClause & Lookahead('OR') & Drop('OR') & tail)[1:] > list
    orAndText = (orClause & Lookahead('AND') & Drop('AND') & tail)[1:] > tuple
    oredAnds = (andClause & Lookahead('OR') & Drop('OR') & andClause)[1:] > list
    andedOrs = (orClause & Lookahead('AND') & Drop('AND') & orClause)[1:] > tuple
    query = (oredAnds | andedOrs | orAndText | andOrText | orClause | andClause | text)[:]

query.parse('foo AND bar') # Works
query.parse('"bar none" OR foo') # Works
query.parse('foo AND "bar none" OR baz AND floo') # Works
query.parse('a AND b OR c AND d OR e') # Doesn't work

The last parse produces this:

[[('a', 'b'), ('c', 'd')], 'OR', 'e']

It should produce this:

[[('a', 'b'), ('c', 'd'), 'e']]

How can I fix this to get the parse I want? I think it would fix it if I could say “whatever AND whatever” becomes a tuple, and “whatever OR whatever” becomes a list.

  • 1 1 Answer
  • 0 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-24T09:18:25+00:00Added an answer on May 24, 2026 at 9:18 am

    Edit: got rid of sloooooow left recursion thanks to this article and added keyword parameters.

    from lepl import *
    def ander(result):
        if len(result) == 2:
            return (result[0], result[1])
        return result[0]
    text = String() | Word()
    andClausePrime = Delayed()
    label = text & Drop(':')
    with DroppedSpace():
        parameter = label & text > (lambda r: {r[0]: r[1]})
        andClause = (parameter | text) & andClausePrime > ander
        andClausePrime += (Drop('AND') & (andClause | parameter | text) & andClausePrime)[:]
        expr = andClause | parameter | text
        query = expr & (Drop('OR') & expr)[:]
    

    The results:

    >>> query.parse('a AND b')
    [('a', 'b')]
    >>> query.parse('a AND b AND c')
    [('a', ('b', 'c'))]
    >>> query.parse('a AND b AND c AND d')
    [('a', ('b', ('c', 'd')))]
    >>> query.parse('a AND b AND c AND d OR e AND f')
    [('a', ('b', ('c', 'd'))), ('e', 'f')]
    >>> query.parse('a AND b AND c AND d OR e OR f')
    [('a', ('b', ('c', 'd'))), 'e', 'f']
    >>> query.parse('foo AND bar')
    [('foo', 'bar')]
    >>> query.parse('"bar none" OR foo')
    ['bar none', 'foo']
    >>> query.parse('key:value AND "hey now":5 OR "what is":up')
    [({'key': 'value'}, {'hey now': '5'}), {'what is': 'up'}]
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

For some reason, after submitting a string like this Jack’s Spindle from a text
I have a text area in my form which accepts all possible characters from
I have a string like this: La Torre Eiffel paragonata all’Everest What PHP function
I have a bunch of posts stored in text files formatted in yaml/textile (from
this is what i have right now Drawing an RSS feed into the php,
I'm parsing an RSS feed that has an ’ in it. SimpleXML turns this
I have this code: - (void)parser:(NSXMLParser *)parser foundCDATA:(NSData *)CDATABlock { NSString *someString = [[NSString
I'm trying to decode HTML entries from here NYTimes.com and I cannot figure out
Does anyone know how can I replace this 2 symbol below from the string
I have a reasonable size flat file database of text documents mostly saved in

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.