1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
|
# encoding: UTF-8
require 'citrus'
module Citrus
# Some helper methods for rules that alias +module_name+ and don't want to
# use +Kernel#eval+ to retrieve Module objects.
module ModuleNameHelpers #:nodoc:
def module_name
capture(:module_name)
end
def module_segments
@module_segments ||= module_name.value.split('::')
end
def module_namespace
module_segments[0...-1].inject(Object) do |namespace, constant|
constant.empty? ? namespace : namespace.const_get(constant)
end
end
def module_basename
module_segments.last
end
end
# A grammar for Citrus grammar files. This grammar is used in Citrus.eval to
# parse and evaluate Citrus grammars and serves as a prime example of how to
# create a complex grammar complete with semantic interpretation in pure Ruby.
File = Grammar.new do #:nodoc:
## Hierarchical syntax
rule :file do
all(:space, zero_or_more(any(:require, :grammar))) {
captures[:require].each do |req|
file = req.value
begin
require file
rescue ::LoadError => e
begin
Citrus.require(file)
rescue LoadError
# Re-raise the original LoadError.
raise e
end
end
end
captures[:grammar].map {|g| g.value }
}
end
rule :grammar do
mod all(:grammar_keyword, :module_name, zero_or_more(any(:include, :root, :rule)), :end_keyword) do
include ModuleNameHelpers
def value
grammar = module_namespace.const_set(module_basename, Grammar.new)
captures[:include].each {|inc| grammar.include(inc.value) }
captures[:rule].each {|r| grammar.rule(r.rule_name.value, r.value) }
root = capture(:root)
grammar.root(root.value) if root
grammar
end
end
end
rule :rule do
mod all(:rule_keyword, :rule_name, zero_or_one(:expression), :end_keyword) do
def rule_name
capture(:rule_name)
end
def value
# An empty rule definition matches the empty string.
expr = capture(:expression)
expr ? expr.value : Rule.for('')
end
end
end
rule :expression do
all(:sequence, zero_or_more([['|', zero_or_one(:space)], :sequence])) {
rules = captures[:sequence].map {|s| s.value }
rules.length > 1 ? Choice.new(rules) : rules.first
}
end
rule :sequence do
one_or_more(:labelled) {
rules = captures[:labelled].map {|l| l.value }
rules.length > 1 ? Sequence.new(rules) : rules.first
}
end
rule :labelled do
all(zero_or_one(:label), :extended) {
label = capture(:label)
rule = capture(:extended).value
rule.label = label.value if label
rule
}
end
rule :extended do
all(:prefix, zero_or_one(:extension)) {
extension = capture(:extension)
rule = capture(:prefix).value
rule.extension = extension.value if extension
rule
}
end
rule :prefix do
all(zero_or_one(:predicate), :suffix) {
predicate = capture(:predicate)
rule = capture(:suffix).value
rule = predicate.value(rule) if predicate
rule
}
end
rule :suffix do
all(:primary, zero_or_one(:repeat)) {
repeat = capture(:repeat)
rule = capture(:primary).value
rule = repeat.value(rule) if repeat
rule
}
end
rule :primary do
any(:grouping, :proxy, :terminal)
end
rule :grouping do
all(['(', zero_or_one(:space)], :expression, [')', zero_or_one(:space)]) {
capture(:expression).value
}
end
## Lexical syntax
rule :require do
all(:require_keyword, :quoted_string) {
capture(:quoted_string).value
}
end
rule :include do
mod all(:include_keyword, :module_name) do
include ModuleNameHelpers
def value
module_namespace.const_get(module_basename)
end
end
end
rule :root do
all(:root_keyword, :rule_name) {
capture(:rule_name).value
}
end
# Rule names may contain letters, numbers, underscores, and dashes. They
# MUST start with a letter.
rule :rule_name do
all(/[a-zA-Z][a-zA-Z0-9_-]*/, :space) {
first.to_s
}
end
rule :proxy do
any(:super, :alias)
end
rule :super do
ext(:super_keyword) {
Super.new
}
end
rule :alias do
all(notp(:end_keyword), :rule_name) {
Alias.new(capture(:rule_name).value)
}
end
rule :terminal do
any(:quoted_string, :case_insensitive_string, :regular_expression, :character_class, :dot) {
primitive = super()
if String === primitive
StringTerminal.new(primitive, flags)
else
Terminal.new(primitive)
end
}
end
rule :quoted_string do
mod all(/(["'])(?:\\?.)*?\1/, :space) do
def value
eval(first.to_s)
end
def flags
0
end
end
end
rule :case_insensitive_string do
mod all(/`(?:\\?.)*?`/, :space) do
def value
eval(first.to_s.gsub(/^`|`$/, '"'))
end
def flags
Regexp::IGNORECASE
end
end
end
rule :regular_expression do
all(/\/(?:\\?.)*?\/[imxouesn]*/, :space) {
eval(first.to_s)
}
end
rule :character_class do
all(/\[(?:\\?.)*?\]/, :space) {
eval("/#{first.to_s.gsub('/', '\\/')}/")
}
end
rule :dot do
all('.', :space) {
DOT
}
end
rule :label do
all(/[a-zA-Z0-9_]+/, :space, ':', :space) {
first.to_str.to_sym
}
end
rule :extension do
any(:tag, :block)
end
rule :tag do
mod all(
['<', zero_or_one(:space)],
:module_name,
['>', zero_or_one(:space)]
) do
include ModuleNameHelpers
def value
module_namespace.const_get(module_basename)
end
end
end
rule :block do
all(
'{',
zero_or_more(any(:block, /[^{}]+/)),
['}', zero_or_one(:space)]
) {
proc = eval("Proc.new #{to_s}", TOPLEVEL_BINDING)
# Attempt to detect if this is a module block using some
# extremely simple heuristics.
if to_s =~ /\b(def|include) /
Module.new(&proc)
else
proc
end
}
end
rule :predicate do
any(:and, :not, :but)
end
rule :and do
all('&', :space) { |rule|
AndPredicate.new(rule)
}
end
rule :not do
all('!', :space) { |rule|
NotPredicate.new(rule)
}
end
rule :but do
all('~', :space) { |rule|
ButPredicate.new(rule)
}
end
rule :repeat do
any(:question, :plus, :star)
end
rule :question do
all('?', :space) { |rule|
Repeat.new(rule, 0, 1)
}
end
rule :plus do
all('+', :space) { |rule|
Repeat.new(rule, 1, Infinity)
}
end
rule :star do
all(/[0-9]*/, '*', /[0-9]*/, :space) { |rule|
min = captures[1] == '' ? 0 : captures[1].to_str.to_i
max = captures[3] == '' ? Infinity : captures[3].to_str.to_i
Repeat.new(rule, min, max)
}
end
rule :module_name do
all(one_or_more([ zero_or_one('::'), :constant ]), :space) {
first.to_s
}
end
rule :require_keyword, [ /\brequire\b/, :space ]
rule :include_keyword, [ /\binclude\b/, :space ]
rule :grammar_keyword, [ /\bgrammar\b/, :space ]
rule :root_keyword, [ /\broot\b/, :space ]
rule :rule_keyword, [ /\brule\b/, :space ]
rule :super_keyword, [ /\bsuper\b/, :space ]
rule :end_keyword, [ /\bend\b/, :space ]
rule :constant, /[A-Z][a-zA-Z0-9_]*/
rule :white, /[ \t\n\r]/
rule :comment, /#.*/
rule :space, zero_or_more(any(:white, :comment))
end
def File.parse(*) # :nodoc:
super
rescue ParseError => e
# Raise SyntaxError when a parse fails.
raise SyntaxError, e
end
end
|