Can any hash function based on the sponge construction work as extendable output function? Keccak provides a sort of very useful XOFs. 


Can other sponge construction hash function like  Spongent work as XOF? 
Is there any lightweight XOF for hardware or software implementation?
Can any hash function based on the sponge construction work as extendable output function?


Yes.

Pick any permutation $\pi\colon \{0,1\}^n \to \{0,1\}^n$, and capacity $c &lt; n$.  For example, you could pick Keccak-p[1600, 24] like SHA-3 uses, with state size $n = 1600$ and capacity $c = 2\lambda$ for a $\lambda$-bit security level—that is, SHAKE128 uses $c = 256$ for 128-bit collision resistance (provided, of course, the output is at least 256 bits).  Let $r = n - c$ be the rate.


Start with the initial state $x_0 = 0^n$, i.e. a string of $n$ zero bits.  Break the padded input message $m$ into $r$-bit blocks $m_1 \mathbin\| m_2 \mathbin\| \cdots \mathbin\| m_\ell$.
Absorb.  For each block $m_i$, update the state $x_i = \pi(x_{i-1} \oplus (m_i \mathbin\| 0^c))$; that is, pad the $r$-bit block $m_i$ with $c = n - r$ zeros, xor it into the state, and permute the state.
Squeeze.  Reveal the first $r$ bits of $x_\ell$, the first $r$ bits of $\pi(x_\ell)$, the first $r$ bits of $\pi^2(x_\ell)$, the first $r$ bits of $\pi^3(x_\ell)$, and so on, until you've produced the number of output bits you want.



  Is there any lightweight XOF for hardware or software implementation?


There are many permutation-based designs these days.

Keccak comes in many sizes: SHA-3 uses Keccak-p[1600, 24] with parameters that were overdesigned partly out of paranoia and partly for political reasons, but KangarooTwelve uses Keccak-p[1600, 12], i.e. half the number of rounds of SHA-3, and higher rates $r$, and still has a good security margin against the best collision attacks.  You could possibly even tune the Keccak parameters to be even smaller if collision resistance isn't important for your application, and there are other options for smaller word sizes.

NORX, a 512- or 1024-bit permutation, was designed like an ARX network but with the approximation $a + b \approx a \oplus b \oplus ((a \wedge b) \mathbin\ll 1)$ to make hardware designs a little cheaper, since integer addition has a high cost for carry propagation; Gimli is a newer design with a 384-bit permutation that improves on NORX.  The CAESAR winner Ascon uses another 320-bit permutation.