Start of FORM8 Interpreter for a Formula graf.frm at Sun Mar 24 17:51:21 2019


Scanner started

Input program:

# \bigwedge_{ 1 < b = 5 } ( \bigwedge_{ 1 < a = 5 } ( ( atleastone ( x _{ a , b , i } : 1 \leq i \leq 10 ) ) ) ) #

Scanned program:

1 10 44 128 30 8 129 35 44 130 29 3 10 44 128 30 8 131 35 44 130 29 3 3 17 3 8 132 57 8 131 58 8 129 58 8 133 29 13 44 128 31 8 133 31 44 134 5 5 5 5 1

Identifiers:b, a, x, i;

Constants:1, 5, 10;

Scanner ended

Parser started


Stack & Word # <•\bigwedge_{#c# 1 < #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Stack & Word # <•\bigwedge_{ <•#c#< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #


Stack & Word # <•\bigwedge_{ <•primary< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Parsing tree

primary
1



Stack & Word # <•\bigwedge_{ <•factor< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•\bigwedge_{ <•term< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•\bigwedge_{ <•expression1< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•\bigwedge_{ <•expression< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #



Stack & Word # <•\bigwedge_{ <•limexpression< #i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #


Stack & Word # <•\bigwedge_{ <•limexpression <•<#i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #


Stack & Word # <•\bigwedge_{ <•limexpression =•lessrel#i# b = #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #

Parsing tree

lessrel


Stack & Word # <•\bigwedge_{ <•limexpression =•lessrel <•#i#= #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #


Stack & Word # <•\bigwedge_{ <•limexpression =•lessrel <•metavariable= #c# 5 } ( \bigwedge_{ #c# 1 < #i# a = #c# 5 } ( ( atleastone ( #i# x _{ #i# a , #i# b , #i# i } : #c# 1 \leq #i# i \leq #c# 10 ) ) ) ) #


lessrel is not in any LCs

reduce error

Interpreter ended at Sun Mar 24 17:51:21 2019