Sha256: c70d44152badbc75835ae7e0d6152fcb328230a1310095fb0ff512a69ab16782
Contents?: true
Size: 1020 Bytes
Versions: 19
Compression:
Stored size: 1020 Bytes
Contents
# Load the builder class
require_relative '../../../lib/rley/syntax/grammar_builder'
require_relative '../../../lib/rley/lexical/token'
module AmbiguousGrammarHelper
# Factory method. Creates a grammar builder for a basic ambiguous
# expression grammar.
# (based on an example from Fisher and LeBlanc: "Crafting a Compiler")
def grammar_builder()
builder = Rley::Syntax::GrammarBuilder.new do
add_terminals('+', 'id')
rule 'S' => 'E'
rule 'E' => %w[E + E]
rule 'E' => 'id'
end
builder
end
# Basic tokenizing method
def tokenize(aText, aGrammar)
tokens = aText.scan(/\S+/).map do |lexeme|
case lexeme
when '+'
terminal = aGrammar.name2symbol[lexeme]
when /^[_a-zA-Z][_a-zA-Z0-9]*$/
terminal = aGrammar.name2symbol['id']
else
msg = "Unknown input text '#{lexeme}'"
raise StandardError, msg
end
Rley::Lexical::Token.new(lexeme, terminal)
end
return tokens
end
end # module
Version data entries
19 entries across 19 versions & 1 rubygems