Browsable Linear Programming Grammar

Grammar extracted by Vadim Zaytsev, see the Grammar Zoo entry for details: api/rascal/linear/extracted
Source used for this grammar: Paul Klint, Jurgen J. Vinju, analysis::linearprogramming::LinearProgramming, 2009–2013 [Explore]

Summary

• Total 8 production rules with 10 top alternatives and 58 symbols.
• Vocabulary: 22 = 8 nonterminals + 0 terminals + 6 labels + 8 markers.
• Total 8 nonterminal symbols: 8 defined (Coefficients, LinearExpression, ObjectiveFun, ConstraintType, Constraint, Constraints, VariableVals, Solution), 0 root (—), 3 top (ObjectiveFun, Constraints, Solution), 0 bottom (—).
• Total 6 labels: [linearExp], [leq], [eq], [geq], [constraint], [solution].
• Total 8 markers: ⟨var⟩ ², ⟨coef⟩, ⟨coefficients⟩ ², ⟨const⟩ ², ⟨ctype⟩, ⟨val⟩, ⟨varVals⟩, ⟨funVal⟩.

Syntax

Coefficients ::=
	(⟨var⟩:string ⟨coef⟩:integer)*

LinearExpression ::=
	[linearExp]::(⟨coefficients⟩:Coefficients ⟨const⟩:integer)

ObjectiveFun ::=
	LinearExpression

ConstraintType ::=
	[leq]::ε
	[eq]::ε
	[geq]::ε

Constraint ::=
	[constraint]::(⟨coefficients⟩:Coefficients ⟨ctype⟩:ConstraintType ⟨const⟩:integer)

Constraints ::=
	Constraint*

VariableVals ::=
	(⟨var⟩:string ⟨val⟩:integer)*

Solution ::=
	[solution]::(⟨varVals⟩:VariableVals ⟨funVal⟩:integer)

Maintained by Dr. Vadim Zaytsev a.k.a. @grammarware. Last updated in September 2015. [↑]