Handbook
Glossary
question>quot ( question -- quot )
Vocabulary
regexp
.
compiler
Inputs
question
an
object
Outputs
quot
an
object
Definition
IN:
regexp.compiler
GENERIC:
question>quot
( question -- quot )
Methods
USING:
combinators.short-circuit
kernel
regexp.classes
regexp.compiler
sequences
;
M:
$crlf
question>quot
drop
[
{
[
length
=
]
[
?nth
"\r\n"
member?
]
}
2||
]
;
USING:
combinators.short-circuit
kernel
regexp.classes
regexp.compiler
sequences
;
M:
$unix
question>quot
drop
[
{
[
length
=
]
[
?nth
10
=
]
}
2||
]
;
USING:
combinators.short-circuit
kernel
math
regexp.classes
regexp.compiler
sequences
;
M:
^crlf
question>quot
drop
[
{
[
drop
zero?
]
[
[
1
-
]
dip
?nth
"\r\n"
member?
]
}
2||
]
;
USING:
combinators.short-circuit
kernel
math
regexp.classes
regexp.compiler
sequences
;
M:
^unix
question>quot
drop
[
{
[
drop
zero?
]
[
[
1
-
]
dip
?nth
10
=
]
}
2||
]
;
USING:
kernel
math
regexp.classes
regexp.compiler
;
M:
beginning-of-input
question>quot
drop
[
drop
zero?
]
;
USING:
combinators.short-circuit
kernel
math
regexp.classes
regexp.compiler
sequences
;
M:
end-of-file
question>quot
drop
[
{
[
length
swap
-
2
<=
]
[
swap
tail
{
"\n"
"\r\n"
"\r"
""
}
member?
]
}
2&&
]
;
USING:
kernel
regexp.classes
regexp.compiler
sequences
;
M:
end-of-input
question>quot
drop
[
length
=
]
;
USING:
kernel
regexp.compiler
;
M:
f
question>quot
drop
[
2drop
f
]
;
USING:
accessors
kernel
quotations
regexp.ast
regexp.compiler
regexp.negation
;
M:
lookahead
question>quot
term>>
ast>dfa
dfa>shortest-word
1quotation
[
f
]
prepose
;
USING:
accessors
kernel
math
quotations
regexp.ast
regexp.compiler
regexp.negation
regexp.private
;
M:
lookbehind
question>quot
term>>
<reversed-option>
ast>dfa
dfa>reverse-shortest-word
1quotation
[
[
1
-
]
dip
f
]
prepose
;
USING:
kernel
regexp.compiler
;
M:
t
question>quot
drop
[
2drop
t
]
;
USING:
kernel
regexp.classes
regexp.compiler
unicode
;
M:
word-break
question>quot
drop
[
word-break-at?
]
;