most extreme grep challenge

% ls
abc abcd q
% grep --version
grep (GNU grep) 2.5.1
% ls | grep ______
abc
========================================
Fill in the blank and no flags fags.  I will judge all entries,
and decide upon the winrars.

you are a moron.

>>2
you are a moron.

>>2
>>3
you are a mormon

'[^dq]$'
'^.\{3\}$'
'c\>'

There are a billion other ways to do it. This is supposed to be extreme?

According to the specification, ls produces one line, containing the text abc abcd dq, so none of these will work; grep cannot chop a line.

btw, assuming multiple lines, c$ is the shortest possible answer.

oh hi

% touch abc abcd q
% ls
abc  abcd  q
% grep --version
grep (GNU grep) 2.5.1
% man grep
[...]
-w, --word-regexp
Select  only  those  lines containing matches that form whole words.  The test is that the matching substring must either be at the beginning of the line, or preceded by a non-word constituent character.  Similarly, it must be either at the end  of  the  line  or followed by a non-word constituent character.  Word-constituent characters are letters, digits, and the underscore.
[...]
% ls | grep -w abc
abc

>>1
RTFM

>>6
By default, ls lists one entry per line to standard output; the excep-
tions are to terminals or when the -C or -x options are specified.

>>8
no flags

>>1
`echo 'printf"%x\$",2+exp(4*atan2 1,1)>>1'|perl`

>>10
The version of ls used was not specified. There's no way to be certain that it adheres to any given standard.

I WANTR AN ANSWER