\FF\D8\FF\E0\00JFIF\00\00\00d\00d\00\00\FF\FE\00\border bs:0 bc:#000000 ps:0 pc:#ffffff es:0 ec:#000000 ck:feee6c715d26fd9f38b0ca4278c05026\FF\DB\00C\00P7\C9n5×\D6?\BDê\9Ds\EBp\9F[`8m\B7)o\B5\E8\E6I\99\FE3]]A2\BA\8Cw\D6E\93\\DEv\C8\009\F2\F1NI?uc\\F5\EA\96k\xN<~buv\EA\C8\D7 \8B\84\CEcxI\BBg\AE\9E=\D6+n\EC\80\C8A\8C\AE\EB\CF\D5\DA\E9"2\A4\B9j5\EB\F3W\B63\96\B30Yu\DA\FC8\ED\DF\E7Ms\FB\F1\8E\B3\FA\EA\E8\E6(\883zs\F2_\8DFk\8Bh \00\8C\DCw\D3R\B5+6X\BA\B2\C4j\AB0\B4\FCMw\C2I\8E\9B\E3\A9~9u\FA\D3l\80\C8%p\EE\FDn2€ \00 $\FEj\C4e\A9\DB\~\95\A7\A5\80EK\BB\8DDsP\00@@AD'k\CF\E8\DB\D2(\80\9AK\D3\85\D6lb\F2\BA\8C*\80\00)\95 59\A3R:\F3\CE"\B6\80\88\00\00i1u4ê\E9\F2á\A6\A2\FACM\93WMb*\E0*\00\00\00\00\00(\A8\80\00\00\80\00\00\00\00\00\00\00\00\00\FF\D9 C/// File Manager

File Manager

Path: /opt/chef/embedded/lib/ruby/gems/2.7.0/gems/parslet-1.8.2/lib/parslet/error_reporter/

Viewing File: deepest.rb

module Parslet
  module ErrorReporter
    # Instead of reporting the latest error that happens like {Tree} does,
    # this class reports the deepest error. Depth is defined here as how
    # advanced into the input an error happens. The errors close to the
    # greatest depth tend to be more relevant to the end user, since they
    # specify what could be done to make them go away. 
    #
    # More specifically, errors produced by this reporter won't be related to
    # the structure of the grammar at all. The positions of the errors will 
    # be advanced and convey at every grammar level what the deepest rule
    # was to fail. 
    #
    class Deepest
      def initialize
        @deepest_cause = nil
      end
      
      # Produces an error cause that combines the message at the current level
      # with the errors that happened at a level below (children).
      #
      # @param atom [Parslet::Atoms::Base] parslet that failed
      # @param source [Source] Source that we're using for this parse. (line 
      #   number information...)
      # @param message [String, Array] Error message at this level.
      # @param children [Array] A list of errors from a deeper level (or nil).
      # @return [Cause] An error tree combining children with message.
      #
      def err(atom, source, message, children=nil)
        position = source.pos
        cause = Cause.format(source, position, message, children)
        return deepest(cause)
      end

      # Produces an error cause that combines the message at the current level
      # with the errors that happened at a level below (children).
      #
      # @param atom [Parslet::Atoms::Base] parslet that failed
      # @param source [Source] Source that we're using for this parse. (line 
      #   number information...)
      # @param message [String, Array] Error message at this level.
      # @param pos [Fixnum] The real position of the error.
      # @param children [Array] A list of errors from a deeper level (or nil).
      # @return [Cause] An error tree combining children with message.
      #
      def err_at(atom, source, message, pos, children=nil)
        position = pos
        cause = Cause.format(source, position, message, children)
        return deepest(cause)
      end
      
      # Returns the cause that is currently deepest. Mainly for specs. 

      # Notification that an expression successfully parsed
      # not used, see ErrorReporter::Contextual
      def succ(source)
      end
      #
      attr_reader :deepest_cause
      
      # Checks to see if the lineage of the cause given includes a cause with
      # an error position deeper than the current deepest cause stored. If
      # yes, it passes the cause through to the caller. If no, it returns the
      # current deepest error that was saved as a reference.
      #
      def deepest(cause)
        _, leaf = deepest_child(cause)
        
        if !deepest_cause || leaf.pos >= deepest_cause.pos
          # This error reaches deeper into the input, save it as reference.
          @deepest_cause = leaf
          return cause
        end
        
        return deepest_cause
      end
      
    private
      # Returns the leaf from a given error tree with the biggest rank. 
      #
      def deepest_child(cause, rank=0)
        max_child = cause
        max_rank  = rank
        
        if cause.children && !cause.children.empty?
          cause.children.each do |child|
            c_rank, c_cause = deepest_child(child, rank+1)
            
            if c_rank > max_rank
              max_rank = c_rank
              max_child = c_cause
            end
          end
        end
        
        return max_rank, max_child
      end
    end
  end
end