1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
//! The parser facility for parsing `.cnf` and `.sat` files as specified in the 
//! [DIMACS format specification](http://www.domagoj-babic.com/uploads/ResearchProjects/Spear/dimacs-cnf.pdf).
//! 
//! The DIMACS format was specified for the DIMACS SAT solver competitions as input file format.
//! Many other DIMACS file formats exist for other competitions, however, this crate currently only
//! supports the formats that are relevant for SAT solvers.
//! 
//! In `.cnf` the entire SAT formula is encoded as a conjunction of disjunctions and so mainly stores
//! a list of clauses consisting of literals.
//! 
//! The `.sat` format is slightly more difficult as the formula can be of a different shape and thus
//! a `.sat` file internally looks similar to a Lisp file.

use lexer::*;
use errors::*;
use items::*;

#[derive(Debug, Clone)]
struct Parser<I>
	where I: Iterator<Item=char>
{
	tokens: ValidLexer<I>,
	peek  : Result<Token>
}

impl<I> Parser<I>
	where I: Iterator<Item=char>
{
	fn from(input: I) -> Parser<I> {
		Parser{
			tokens: ValidLexer::from(input),
			peek  : Err(ParseError::new(Loc::new(0, 0), ErrorKind::EmptyTokenStream))
		}
	}

	fn mk_err(&self, kind: ErrorKind) -> ParseError {
		ParseError::new(self.peek_loc(), kind)
	}

	fn err<T>(&self, kind: ErrorKind) -> Result<T> {
		Err(self.mk_err(kind))
	}

	fn peek_loc(&self) -> Loc {
		match self.peek {
			Ok(tok)  => tok.loc,
			Err(err) => err.loc
		}
	}

	fn consume(&mut self) -> Result<Token> {
		self.peek = self.tokens
			.next()
			.unwrap_or(Ok(Token::new(self.peek_loc(), TokenKind::EndOfFile)));
		self.peek
	}

	fn expect(&mut self, expected: TokenKind) -> Result<Token> {
		use self::TokenKind::EndOfFile;
		use self::ErrorKind::{UnexpectedEndOfFile, UnexpectedToken};
		match self.peek?.kind {
			k if k == expected => self.consume(),
			EndOfFile          => self.err(UnexpectedEndOfFile),
			_                  => self.err(UnexpectedToken)
		}
	}

	fn is_at_eof(&self) -> bool {
		match self.peek {
			Ok(peek) => peek.kind == TokenKind::EndOfFile,
			_        => false
		}
	}

	fn expect_nat(&mut self) -> Result<u64> {
		match self.peek?.kind {
			TokenKind::Nat(val) => {
				self.consume()?;
				Ok(val)
			},
			_ => self.err(ErrorKind::ExpectedNat)
		}
	}

	fn parse_header(&mut self) -> Result<Instance> {
		use self::TokenKind::{Ident};
		use self::Ident::*;
		self.expect(Ident(Problem))?;
		match self.peek?.kind {
			Ident(Cnf)   => self.parse_cnf_header(),
			Ident(Sat)   |
			Ident(Sate)  |
			Ident(Satx)  |
			Ident(Satex) => self.parse_sat_header(),
			_ => self.err(ErrorKind::UnexpectedToken)
		}
	}

	fn parse_cnf_header(&mut self) -> Result<Instance> {
		self.expect(TokenKind::Ident(Ident::Cnf))?;
		let num_vars    = self.expect_nat()?;
		let num_clauses = self.expect_nat()?;
		Ok(Instance::cnf(num_vars, self.parse_clauses(num_clauses)?))
	}

	fn parse_lit(&mut self) -> Result<Lit> {
		match self.peek?.kind {
			TokenKind::Minus => {
				self.consume()?;
				Ok(Lit::from_i64(-(self.expect_nat()? as i64)))
			}
			TokenKind::Nat(val) => {
				self.consume()?;
				Ok(Lit::from_i64(val as i64))
			},
			_ => self.err(ErrorKind::ExpectedLit)
		}
	}

	fn parse_clause(&mut self) -> Result<Clause> {
		use self::TokenKind::{Minus, Nat, Zero, EndOfFile};
		use self::ErrorKind::{UnexpectedToken};
		let mut lits = Vec::new();
		loop {
			match self.peek?.kind {
				Minus | Nat(_)   => lits.push(self.parse_lit()?),
				Zero | EndOfFile => { self.consume()?; return Ok(Clause::from_vec(lits)) },
				_                => return self.err(UnexpectedToken)
			}
		}
	}

	fn parse_clauses(&mut self, num_clauses: u64) -> Result<Vec<Clause>> {
		let mut clauses = Vec::with_capacity(num_clauses as usize);
		while !self.is_at_eof() {
			clauses.push(self.parse_clause()?);
		}
		Ok(clauses) 
	}

	fn parse_sat_extensions<'a>(&'a mut self) -> Result<Extensions> {
		use self::TokenKind::{Ident};
		use self::Ident::{Sat, Sate, Satx, Satex};
		use self::ErrorKind::*;
		match self.peek?.kind {
			Ident(Sat)   => { self.consume()?; Ok(NONE) },
			Ident(Sate)  => { self.consume()?; Ok(EQ) },
			Ident(Satx)  => { self.consume()?; Ok(XOR) },
			Ident(Satex) => { self.consume()?; Ok(EQ | XOR) },
			_ => self.err(InvalidSatExtension)
		}
	}

	fn parse_sat_header(&mut self) -> Result<Instance> {
		let extensions = self.parse_sat_extensions()?;
		let num_vars   = self.expect_nat()?;
		Ok(Instance::sat(num_vars, extensions, self.parse_paren_formula()?))
	}

	fn parse_formula(&mut self) -> Result<Formula> {
		use lexer::TokenKind::*;
		use lexer::Ident::*;
		let tok = self.peek?;
		match tok.kind {
			Nat(val)   => { self.consume()?; Ok(Formula::lit(Lit::from_i64(val as i64))) },
			Open       => self.parse_paren_formula(),
			Plus       => self.parse_or_formula(),
			Star       => self.parse_and_formula(),
			Minus      => self.parse_neg_formula(),
			Eq         => self.parse_eq_formula(),
			Ident(Xor) => self.parse_xor_formula(),
			_          => self.err(ErrorKind::UnexpectedToken)
		}
	}

	fn parse_formula_list(&mut self) -> Result<Vec<Formula>> {
		let mut formulas = Vec::new();
		while self.peek?.kind != TokenKind::Close {
			formulas.push(self.parse_formula()?);
		}
		Ok(formulas)
	}

	fn parse_formula_params(&mut self) -> Result<Vec<Formula>> {
		self.expect(TokenKind::Open)?;
		let params = self.parse_formula_list()?;
		self.expect(TokenKind::Close)?;
		Ok(params)
	}

	fn parse_paren_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Open)?;
		let formula = Formula::paren(self.parse_formula()?);
		self.expect(TokenKind::Close)?;
		Ok(formula)
	}

	fn parse_neg_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Minus)?;
		let tok = self.peek?;
		match tok.kind {
			TokenKind::Open => {
				self.expect(TokenKind::Open)?;
				let formula = Formula::neg(self.parse_formula()?);
				self.expect(TokenKind::Close)?;
				Ok(formula)
			},
			TokenKind::Nat(val) => {
				self.consume()?;
				Ok(Formula::lit(Lit::from_i64( -(val as i64) )))
			},
			_ => self.err(ErrorKind::UnexpectedToken)
		}
	}

	fn parse_or_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Plus)?;
		Ok(Formula::or(self.parse_formula_params()?))
	}

	fn parse_and_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Star)?;
		Ok(Formula::and(self.parse_formula_params()?))
	}

	fn parse_eq_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Eq)?;
		Ok(Formula::eq(self.parse_formula_params()?))
	}

	fn parse_xor_formula(&mut self) -> Result<Formula> {
		self.expect(TokenKind::Ident(Ident::Xor))?;
		Ok(Formula::xor(self.parse_formula_params()?))
	}

	fn parse_dimacs(&mut self) -> Result<Instance> {
		self.consume()?;
		let instance = self.parse_header();
		if self.is_at_eof() {
			instance
		}
		else {
			self.err(ErrorKind::NotParsedToEnd)
		}
	}
}

/// Parses a the given string as `.cnf` or `.sat` file as specified in
/// [DIMACS format specification](http://www.domagoj-babic.com/uploads/ResearchProjects/Spear/dimacs-cnf.pdf).
/// 
/// Returns an appropriate SAT instance if no errors occured while parsing.
pub fn parse_dimacs(input: &str) -> Result<Instance> {
	Parser::from(input.chars()).parse_dimacs()
}

#[cfg(test)]
mod tests {
	use super::*;

	#[test]
	fn simple_cnf_1() {
		let sample = r"
			c Sample DIMACS .cnf file
			c holding some information
			c and trying to be some
			c kind of a test.
			p cnf 42 1337
			1 2 0
			-3 4 0
			5 -6 7 0
			-7 -8 -9 0";
		let parsed = parse_dimacs(sample).expect("valid .cnf");
		let expected = Instance::cnf(42, vec![
			Clause::from_vec(vec![Lit::from_i64( 1), Lit::from_i64( 2)]),
			Clause::from_vec(vec![Lit::from_i64(-3), Lit::from_i64( 4)]),
			Clause::from_vec(vec![Lit::from_i64( 5), Lit::from_i64(-6), Lit::from_i64( 7)]),
			Clause::from_vec(vec![Lit::from_i64(-7), Lit::from_i64(-8), Lit::from_i64(-9)])
		]);
		assert_eq!(parsed, expected);
	}

	#[test]
	fn simple_cnf_2() {
		let sample = r"
			c Example CNF format file
			c
			p cnf 4 3
			1 3 -4 0
			4 0 2
			-3";
		let parsed = parse_dimacs(sample).expect("valid .cnf");
		let expected = Instance::cnf(4, vec![
			Clause::from_vec(vec![Lit::from_i64( 1), Lit::from_i64( 3), Lit::from_i64(-4)]),
			Clause::from_vec(vec![Lit::from_i64( 4)]),
			Clause::from_vec(vec![Lit::from_i64( 2), Lit::from_i64(-3)])
		]);
		assert_eq!(parsed, expected);
	}

	#[test]
	fn simple_sat() {
		let sample = r"
			c Sample DIMACS .sat file
			p sat 42
			(*(+(1 3 -4)
			+(4)
			+(2 3)))";
		let parsed = parse_dimacs(sample).expect("valid .sat");
		let expected = Instance::sat(42, NONE,
			Formula::paren(
				Formula::and(vec![
					Formula::or(vec![
						Formula::lit(Lit::from_i64(1)), Formula::lit(Lit::from_i64(3)), Formula::lit(Lit::from_i64(-4))
					]),
					Formula::or(vec![
						Formula::lit(Lit::from_i64(4))
					]),
					Formula::or(vec![
						Formula::lit(Lit::from_i64(2)), Formula::lit(Lit::from_i64(3))
					])
				])
			)
		);
		assert_eq!(parsed, expected);
	}
}