Compare commits
3 Commits
5af3179ff2
...
53d97150d1
Author | SHA1 | Date | |
---|---|---|---|
53d97150d1 | |||
74f02c1bd9 | |||
5e866b219c |
@ -50,10 +50,67 @@ class Propane
|
||||
end
|
||||
end
|
||||
end
|
||||
determine_possibly_empty_rulesets!(rule_sets)
|
||||
@lexer = Lexer.new(@grammar.tokens, @grammar.drop_tokens)
|
||||
@parser = Parser.new(rule_sets["Start"])
|
||||
end
|
||||
|
||||
# Determine which grammar rules could expand to empty sequences.
|
||||
#
|
||||
# @param rule_sets [Hash]
|
||||
# RuleSets.
|
||||
#
|
||||
# @return [void]
|
||||
def determine_possibly_empty_rulesets!(rule_sets)
|
||||
begin
|
||||
newly_discovered_empty_rulesets = false
|
||||
rule_sets.each do |name, rule_set|
|
||||
unless rule_set.could_be_empty?
|
||||
if could_rule_set_be_empty?(rule_set)
|
||||
newly_discovered_empty_rulesets = true
|
||||
rule_set.could_be_empty = true
|
||||
end
|
||||
end
|
||||
end
|
||||
end while newly_discovered_empty_rulesets
|
||||
end
|
||||
|
||||
# Determine whether a RuleSet could be empty.
|
||||
#
|
||||
# @param rule_set [RuleSet]
|
||||
# RuleSet to test.
|
||||
#
|
||||
# @return [Boolean]
|
||||
# Whether the RuleSet could be empty.
|
||||
def could_rule_set_be_empty?(rule_set)
|
||||
rule_set.rules.any? do |rule|
|
||||
could_rule_be_empty?(rule)
|
||||
end
|
||||
end
|
||||
|
||||
# Determine whether a Rule could be empty.
|
||||
#
|
||||
# @param rule [Rule]
|
||||
# Rule to test.
|
||||
#
|
||||
# @return [Boolean]
|
||||
# Whether the Rule could be empty.
|
||||
def could_rule_be_empty?(rule)
|
||||
i = 0
|
||||
loop do
|
||||
if i == rule.components.size
|
||||
return true
|
||||
end
|
||||
if rule.components[i].is_a?(Token)
|
||||
return false
|
||||
end
|
||||
if !rule.components[i].could_be_empty?
|
||||
return false
|
||||
end
|
||||
i += 1
|
||||
end
|
||||
end
|
||||
|
||||
end
|
||||
|
||||
end
|
||||
|
@ -112,13 +112,11 @@ class Propane
|
||||
def close!
|
||||
eval_items = @items
|
||||
while eval_items.size > 0
|
||||
this_eval_items = eval_items
|
||||
eval_items = Set.new
|
||||
this_eval_items.each do |item|
|
||||
item.closed_items.each do |new_item|
|
||||
unless @items.include?(new_item)
|
||||
eval_items << new_item
|
||||
end
|
||||
item = eval_items.first
|
||||
eval_items.delete(item)
|
||||
item.closed_items.each do |new_item|
|
||||
unless @items.include?(new_item)
|
||||
eval_items << new_item
|
||||
end
|
||||
end
|
||||
@items += eval_items
|
||||
|
@ -10,6 +10,10 @@ class Propane
|
||||
# Rules in the RuleSet.
|
||||
attr_reader :rules
|
||||
|
||||
# @return [Boolean]
|
||||
# Whether the RuleSet could expand to an empty sequence.
|
||||
attr_writer :could_be_empty
|
||||
|
||||
# Construct a RuleSet.
|
||||
#
|
||||
# @param name [String]
|
||||
@ -26,9 +30,6 @@ class Propane
|
||||
# Rule to add.
|
||||
def <<(rule)
|
||||
@rules << rule
|
||||
if rule.empty?
|
||||
@could_be_empty = true
|
||||
end
|
||||
end
|
||||
|
||||
# Return whether any Rule in the RuleSet is empty.
|
||||
@ -39,6 +40,30 @@ class Propane
|
||||
@could_be_empty
|
||||
end
|
||||
|
||||
# Build the start token set for the RuleSet.
|
||||
#
|
||||
# @return [Set<Token>]
|
||||
# Start token set for the RuleSet.
|
||||
def start_token_set
|
||||
if @_start_token_set.nil?
|
||||
@_start_token_set = Set.new
|
||||
@rules.each do |rule|
|
||||
rule.components.each do |component|
|
||||
if component.is_a?(Token)
|
||||
@_start_token_set << component
|
||||
break
|
||||
else
|
||||
@_start_token_set += component.start_token_set
|
||||
unless component.could_be_empty?
|
||||
break
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
@_start_token_set
|
||||
end
|
||||
|
||||
end
|
||||
|
||||
end
|
||||
|
Loading…
x
Reference in New Issue
Block a user