Sha256: ef3818e34eebec298af81786dab0b7cf09927f625865f7c87b30d794fab58794
Contents?: true
Size: 1018 Bytes
Versions: 8
Compression:
Stored size: 1018 Bytes
Contents
# Load the builder class
require_relative '../../../lib/rley/syntax/grammar_builder'
require_relative '../../../lib/rley/tokens/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::Tokens::Token.new(lexeme, terminal)
end
return tokens
end
end # module
Version data entries
8 entries across 8 versions & 1 rubygems