Prosecution Insights
Last updated: August 17, 2026
Application No. 18/894,265

Hybrid Feedback-Driven Transpiler System

Non-Final OA §DP
Filed
Sep 24, 2024
Priority
Nov 15, 2022 — continuation of 12/141,560
Examiner
VO, TED T
Art Unit
Tech Center
Assignee
Bank of America Corporation
OA Round
1 (Non-Final)
81%
Grant Probability
Favorable
1-2
OA Rounds
1y 3m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 81% — above average
81%
Career Allowance Rate
663 granted / 818 resolved
+21.1% vs TC avg
Moderate +9% lift
Without
With
+9.4%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
13 currently pending
Career history
831
Total Applications
across all art units

Statute-Specific Performance

§101
16.1%
-23.9% vs TC avg
§103
40.3%
+0.3% vs TC avg
§102
15.1%
-24.9% vs TC avg
§112
15.1%
-24.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 818 resolved cases

Office Action

§DP
Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . DETAILED ACTION This action is in response to the claimed listing filed on 09/24/2024. Claims 1-20 are pending. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-20 of U.S. Patent No. US12141560B2. Although the claims at issue are not identical, they are not patentably distinct from each other because: Current Application US12141560B2 (App. 18/055558) 1. A transpilation platform, comprising: at least one processor; and memory storing computer-readable instructions that, when executed by the at least one processor, cause the transpilation platform to: receive, from a source computing system via a network, a source file, wherein the source computing system comprises a data repository storing the source file associated with a source programming language; parse the source file to generate a first intermediate file corresponding to a structure of the source programming language; transpile, by a machine-learning (ML) transpilation model, terms from the source programming language to corresponding terms in a target programming language, wherein a target computing system processes operations in a target file associated with the target programming language, wherein the source programming language and the target programming language are different programming languages; generate, based on transpiled terms received from the ML transpilation model, a second intermediate file corresponding to a structure of the target programming language; generate, based on the second intermediate file, a target file comprising instructions in the target programming language, wherein the target file causes the target computing system to perform actions performed by the source computing system based on the source file; and train, by a language learning engine, the ML transpilation model, based on feedback received from the target computing system after performance of operations based on execution of the target file. ----------------------------------------------- 2. The transpilation platform of claim 1, wherein the target programming language is a dialect of the source programming language. 3. The transpilation platform of claim 1, wherein the source programming language is unrelated to the target programming language. 4. The transpilation platform of claim 1, wherein the first intermediate file is an abstract syntax tree (AST) file. 5. The transpilation platform of claim 1, wherein the instructions cause the transpilation platform to automatically train the ML transpilation model based on documentation describing operations of the source programming language and the target programming language. 6. The transpilation platform of claim 5, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of the source programming language: generate a first configuration file based on output from the natural language processor, wherein the first configuration file identifies a plurality of characteristics of operations of the source programming language; and train the ML model based on the first configuration file. 7. The transpilation platform of claim 6, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of the target programming language: generate a second configuration file based on output from the natural language processor, wherein the second configuration file identifies a plurality of characteristics of operations of the source programming language; and train the ML model based on the second configuration file. 8. The transpilation platform of claim 7, wherein the instructions cause the transpilation platform to: generate, based on the first configuration file and the second configuration file, a first mapping between operations of the source programming language and the target programming language. 9. The transpilation platform of claim 7, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of a third programming language: generate a third configuration file based on output from the natural language processor, wherein the third configuration file identifies a plurality of characteristics of operations of the source programming language; train the ML model based on the third configuration file; and generate, by the ML model, a second mapping of operations between the target programming language and the third programming language. 10. The transpilation platform of claim 9, wherein the instructions cause the transpilation platform to: generate, by the ML model and based on first mapping of operations and the second mapping of operations, a third mapping of operations between the source programming language and the third programming language. 1. A system comprising: a source computing system comprising a data repository storing a source file associated with a source programming language; a target computing system comprising configured to process operations in a target file associated with a target programming language, wherein the source programming language and the target programming language are different programming languages; a transpilation platform, comprising: at least one processor; and memory storing computer-readable instructions that, when executed by the at least one processor, cause the transpilation platform to: receive, from the source computing system via a network, the source file; parse the source file to generate a first intermediate file corresponding to a structure of the source programming language; transpile, by a machine-learning (ML) transpilation model, terms from the source programming language to corresponding terms in the target programming language; generate, based on transpiled terms received from the ML transpilation model, a second intermediate file corresponding to a structure of the target programming language; generate, based on the second intermediate file, a target file comprising instructions in the target programming language, wherein the target file causes the target computing system to perform actions performed by the source computing system based on the source file; and train, by a language learning engine, the ML transpilation model, based on feedback received from the target computing system after performance of operations based on execution of the target file. ----------------------------------------------- 2. The system of claim 1, wherein the target programming language is a dialect of the source programming language. 3. The system of claim 1, wherein the source programming language is unrelated to the target programming language. 4. The system of claim 1, wherein the first intermediate file is an abstract syntax tree (AST) file. 5. The system of claim 1, wherein the instructions cause the transpilation platform to automatically train the ML transpilation model based on documentation describing operations of the source programming language and the target programming language. 6. The system of claim 5, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of the source programming language: generate a first configuration file based on output from the natural language processor, wherein the first configuration file identifies a plurality of characteristics of operations of the source programming language; and train the ML model based on the first configuration file. 7. The system of claim 6, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of the target programming language: generate a second configuration file based on output from the natural language processor, wherein the second configuration file identifies a plurality of characteristics of operations of the source programming language; and train the ML model based on the second configuration file. 8. The system of claim 7, wherein the instructions cause the transpilation platform to: generate, based on the first configuration file and the second configuration file, a first mapping between operations of the source programming language and the target programming language. 9. The system of claim 7, wherein the instructions cause the transpilation platform to: process, via a natural language processor, the documentation describing operations of a third programming language: generate a third configuration file based on output from the natural language processor, wherein the third configuration file identifies a plurality of characteristics of operations of the source programming language; train the ML model based on the third configuration file; and generate, by the ML model, a second mapping of operations between the target programming language and the third programming language. 10. The system of claim 9, wherein the instructions cause the transpilation platform to: generate, by the ML model and based on first mapping of operations and the second mapping of operations, a third mapping of operations between the source programming language and the third programming language. - Current Claims 1-10 are directed to a transpilation platform. -Current Claims 11-20 of the Application are directed to Non-transitory computer-readable media, and recite the limitations corresponding to the limitations in the current claims 1-10 in the table above. Therefore, they would be compared to the claims in the US Patent, provided in the above table or with the method and the system claims of the above US Patent. The Claims in the current Application recite to extend its claimed functionality on a platform and on non-transitory computer-readable media. From the table above, the features in the current claims are rearranged in comparison to the limitations in the claims of the US patent. Although the claims at issue are not identical, they are not patentable distinct from each other. Therefore, it would be obvious to one of the ordinary skills in the art before the effective filing of the invention to modify current claims (as seen in the compared table above) from the US patent claims for extending coverage. Allowable Subject Matter Claims 1-20 are subjected under the Double Patenting issue given above; the Claims would be allowable, provided with Double Patenting resolved. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Ted T Vo whose telephone number is (571)272-3706. The examiner can normally be reached 8am-4:30pm ET. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Wei Y Mui can be reached at (571) 272-3708. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. TTV July 9, 2026 /Ted T. Vo/ Primary Examiner, Art Unit 2191
Read full office action

Prosecution Timeline

Sep 24, 2024
Application Filed
Jul 15, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12699552
TAGGING DETERMINISTIC CODE IN ARTIFICIAL INTELLIGENCE-GENERATED CODE
2y 7m to grant Granted Aug 04, 2026
Patent 12693838
PROGRAM ANALYSIS, DESIGN SPACE EXPLORATION AND VERIFICATION FOR HIGH-LEVEL SYNTHESIS VIA E-GRAPH REWRITING
2y 7m to grant Granted Jul 28, 2026
Patent 12688024
Pseudocode to Hardware Description Language (HDL) Translation
2y 6m to grant Granted Jul 21, 2026
Patent 12688113
TEXT SEARCH PROCESSING METHOD AND RELATED DEVICE
2y 5m to grant Granted Jul 21, 2026
Patent 12688036
POST QUANTUM CRYPTOGRAPHY MIGRATION MANAGEMENT
2y 8m to grant Granted Jul 21, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
81%
Grant Probability
90%
With Interview (+9.4%)
3y 2m (~1y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 818 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month