Our news editors obtained a quote from the research, "For example, a rule A ? alpha & (sic)B defines a symbol a, as long as it is preceded by a string defined by B. The conjunction operator in this example is taken from conjunctive grammars (Okhotin, 2001), which are an extension of ordinary context-free grammars that maintains most of their practical properties, including many parsing algorithms."
According to the news editors, the research concluded: "This paper gives two equivalent definitions of grammars with left contexts by logical deduction and by language equations and establishes their basic properties, including a transformation to a normal form and a cubictime parsing algorithm, with a square-time version for unambiguous grammars."
For more information on this research see: An extension of context-free grammars with one-sided context specifications. Information and Computation, 2014;237():268-293. Information and Computation can be contacted at: Academic Press Inc Elsevier Science,
The news editors report that additional information may be obtained by contacting
Keywords for this news article include:
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC
Most Popular Stories
- Tablets, Cars Drive AT&T Gains
- 2015 Mazda MX-5 Miata Is Fast and Eager
- Small Businesses Add 3 More Worries to Their List
- DOMA Tech Adding Jobs to Process VA Claims
- Apple Warns of China iCloud Attack
- Job Hunting Is Hard Work
- Tech Firms Flock to LA's 'Silicon Beach'
- Stocks Subdued After Gains Earlier in Week
- Ford, GM Expect to Report Strong Profits
- Consumer Prices Edge Up, Surprising Economists