Click here to Skip to main content
15,892,161 members
Articles / Programming Languages / C#

Spart, a parser generator framework 100% C#

Rate me:
Please Sign up or sign in to vote.
4.76/5 (71 votes)
22 Dec 20038 min read 351.1K   5.2K   129  
Spart is the C# sister of Spirit. It lets you quickly create code parsers directly in your application.
/// Spart License (zlib/png)
/// 
/// 
/// Copyright (c) 2003 Jonathan de Halleux
/// 
/// This software is provided 'as-is', without any express or implied warranty. 
/// In no event will the authors be held liable for any damages arising from 
/// the use of this software.
/// 
/// Permission is granted to anyone to use this software for any purpose, 
/// including commercial applications, and to alter it and redistribute it 
/// freely, subject to the following restrictions:
/// 
/// 1. The origin of this software must not be misrepresented; you must not 
/// claim that you wrote the original software. If you use this software in a 
/// product, an acknowledgment in the product documentation would be 
/// appreciated but is not required.
/// 
/// 2. Altered source versions must be plainly marked as such, and must not be 
/// misrepresented as being the original software.
/// 
/// 3. This notice may not be removed or altered from any source distribution.
/// 
/// Author: Jonathan de Halleux
namespace Spart.Scanners
{
	using System;
	using Spart.Parsers;


	/// <summary>
	/// Input scanner interface
	/// </summary>
	public interface IScanner
	{
		/// <summary>
		/// Return true if all input is consummed
		/// </summary>
		bool AtEnd {get;}

		/// <summary>
		/// Reads one character of the input
		/// </summary>
		/// <returns>true if not at end</returns>
		bool Read();

		/// <summary>
		/// Current character
		/// </summary>
		/// <returns></returns>
		char Peek();

		/// <summary>
		/// Scanner cursor position
		/// </summary>
		long Offset{get;set;}

		/// <summary>
		/// Move cursor position to the offset
		/// </summary>
		/// <param name="offset"></param>
		void Seek(long offset);

		/// <summary>
		/// Extracts a substring of the input
		/// </summary>
		/// <param name="offset"></param>
		/// <param name="length"></param>
		/// <returns></returns>
		String Substring(long offset, int length);

		/// <summary>
		/// Sets the input filter
		/// </summary>
		IFilter Filter{get;set;}

		/// <summary>
		/// Create a failure match
		/// </summary>
		ParserMatch NoMatch      {get;}

		/// <summary>
		/// Create an empty match
		/// </summary>
		ParserMatch EmptyMatch   {get;}

		/// <summary>
		/// Create a match out of the intput
		/// </summary>
		/// <param name="offset"></param>
		/// <param name="length"></param>
		/// <returns></returns>
		ParserMatch CreateMatch(long offset, int length);
	}
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Engineer
United States United States
Jonathan de Halleux is Civil Engineer in Applied Mathematics. He finished his PhD in 2004 in the rainy country of Belgium. After 2 years in the Common Language Runtime (i.e. .net), he is now working at Microsoft Research on Pex (http://research.microsoft.com/pex).

Comments and Discussions