Sha256: 1e10115278d06456254e84ab0a6e3a6245ec9f9a33e84f2be8bbc49ede4c44f6
Contents?: true
Size: 1.76 KB
Versions: 1
Compression:
Stored size: 1.76 KB
Contents
# encoding: utf-8 require "set" module Antelope module Ace class Grammar # Manages precedence for tokens. module Precedences # Accesses the generated precedence list. Lazily generates # the precedence rules on the go, and then caches it. # # @return [Array<Ace::Precedence>] def precedence @_precedence ||= generate_precedence end # Finds a precedence rule for a given token. If no direct # rule is defined for that token, it will check for a rule # defined for the special symbol, `:_`. By default, there # is always a rule defined for `:_`. # # @param token [Ace::Token, Symbol] # @return [Ace::Precedence] def precedence_for(token) token = token.name if token.is_a?(Token) set = Set.new([token, :_]) precedence. select { |pr| set.intersection(pr.tokens).any? }. first end private # Generates the precedence rules. Loops through the compiler # given precedence settings, and then adds two default # precedence rules; one for `:$` (level 0, nonassoc), and one # for `:_` (level 1, nonassoc). # # @return [Array<Ace::Precedence>] def generate_precedence size = @compiler.options[:prec].size + 1 precedence = @compiler.options[:prec]. each_with_index.map do |prec, i| Ace::Precedence.new(prec[0], prec[1..-1].to_set, size - i) end precedence << Ace::Precedence.new(:nonassoc, [:"$"].to_set, 0) << Ace::Precedence.new(:nonassoc, [:_].to_set, 1) precedence.sort_by { |_| _.level }.reverse end end end end end
Version data entries
1 entries across 1 versions & 1 rubygems
Version | Path |
---|---|
antelope-0.1.2 | lib/antelope/ace/grammar/precedences.rb |