Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: Searching for duplication in legacy code (ctags and static parsing)

by LanX (Sage)
on Nov 23, 2016 at 18:18 UTC ( #1176443=note: print w/replies, xml ) Need Help??

in reply to Searching for duplication in legacy code

For completeness, the "classical" approach to find all subs in a source file is ctags .

I can't test at the moment, but I suppose after all these years it's well tested by now.

But please keep in mind that this (like PPI) does static parsing (and Only Perl can parse Perl).

Approaches like B::Xref do compile the code (i.e. let Perl parse Perl) before inspecting it. *

See for instance How to find all the available functions in a file or methods in a module? for a list of edge cases where static parsing fails.

Again just for completeness, from your description I suppose that static parsing is sufficient for you, but maybe you should be aware of the limitations.

HTH! :)

Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!

*) with the drawback that compiling can already have the side effects of running code, while static parsing is "safe".

) or Re^3: Perl not BNF-able?? with some limitations listed by adamk, who is PPI's author.

  • Comment on Re: Searching for duplication in legacy code (ctags and static parsing)

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1176443]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (2)
As of 2023-03-23 20:02 GMT
Find Nodes?
    Voting Booth?
    Which type of climate do you prefer to live in?

    Results (60 votes). Check out past polls.