LiteralOrFormula parses a single Term, an equality or inequality from a given string.
(s string)
| 695 | |
| 696 | // LiteralOrFormula parses a single Term, an equality or inequality from a given string. |
| 697 | func LiteralOrFormula(s string) (ast.Term, error) { |
| 698 | p, err := newParser(s) |
| 699 | if err != nil { |
| 700 | return nil, err |
| 701 | } |
| 702 | defer p.reset() |
| 703 | |
| 704 | tree := p.parser.LiteralOrFml() |
| 705 | if err := p.error(); err != nil { |
| 706 | return nil, err |
| 707 | } |
| 708 | term := p.Visit(tree) |
| 709 | if err := p.error(); err != nil { |
| 710 | return nil, err |
| 711 | } |
| 712 | return term.(ast.Term), nil |
| 713 | } |
| 714 | |
| 715 | // Term parses a Term from given string. |
| 716 | func Term(s string) (ast.Term, error) { |