Prosecution Insights
Last updated: July 17, 2026
Application No. 18/282,743

METHOD AND APPARATUS FOR IMPLEMENTING CONDITIONAL COMPILATION, DEVICE AND STORAGE MEDIUM

Non-Final OA §103
Filed
Jun 06, 2024
Priority
Mar 24, 2021 — CN 202110315401.6 +1 more
Examiner
RAMPURIA, SATISH
Art Unit
2193
Tech Center
2100 — Computer Architecture & Software
Assignee
Beijing Bytedance Network Technology Co., Ltd.
OA Round
1 (Non-Final)
89%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 89% — above average
89%
Career Allowance Rate
752 granted / 846 resolved
+33.9% vs TC avg
Strong +25% interview lift
Without
With
+25.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
9 currently pending
Career history
862
Total Applications
across all art units

Statute-Specific Performance

§101
4.0%
-36.0% vs TC avg
§103
88.0%
+48.0% vs TC avg
§102
5.5%
-34.5% vs TC avg
§112
1.0%
-39.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 846 resolved cases

Office Action

§103
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 preliminary amendment filed on 09/18/2023. Claims 1-12 are canceled by the applicants. Claims 13-32 are added by the applicants. Claims 13-32 are pending. Examiner’s Note Please note that Examiner cites particular columns and line numbers in the references as applied to the claims below for the convenience of the applicant. Although the specified citations are representative of the teachings in the art and are applied to the specific limitations within the individual claim, other passages and figures may apply as well. It is respectfully requested that, in preparing responses, the applicant fully consider the references in entirely as potentially teaching all or part of the claimed invention, as well as the context of the passage as taught by the prior art or disclosed by the examiner. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 13-32 is/are rejected under 35 U.S.C. 103 as being unpatentable over 20170116109 to Perez Acosta et al. in view of USPN US20200249922 to ZHAO. Per claim 13: Perez Acosta discloses: 13. (New) A method for implementing conditional compilation, comprising: compiling a Dart code of a project (Fig. 4, element 660 and related discussion), the Dart code comprising an import sentence for importing a non-local library file (applicants’ specification [0086] describes dart code to be java, c++ etc. also note that the token is considered as sentence, Paragraph [0024] “token (i.e., sentence) may be undefined because, for example, the file (e.g., a header file) that includes the definition of the token is missing from the program source code… determining that the token is defined in an external file the external file (i.e., non-local file) can be suggested (i.e., imported)”); acquiring information on an import condition in the import sentence in response to compiling the import sentence (Paragraph [0026] “paths that originate from the file that includes the token can be obtained. Operation 212 is described in more detail with respect to FIG. 1f. At operation 213 each path that originates from the file that includes the token can be traversed”); searching for an assigned value for the import condition from pre-obtained assigned values for conditions in the Dart code (Paragraph [0026] “path traversed can be segmented based on the folder in which the node resides… the traversal of each path can stop when a node in it belongs to the project… Stop walking up each path when a file in it is part of the current project (and do not offer files in project as a suggestion)… the token was defined can be offered as a suggestion at the bottom of the list. This method can handle the case of standard libraries where for the “string” example suggested fixes of “string” and “xstring” would be displayed as shown in FIG. 1i”). Perez Acosta does not explicitly disclose importing, in response to the assigned value for the import condition according with a preset condition, the non-local library file pointed in response to the import condition according with the preset condition into the Dart code for compilation. However, ZHAO discloses in an analogous computer system importing, in response to the assigned value for the import condition according with a preset condition (Paragraph [0066] “an importing unit 22 configured to import all the initial class files into a specified number of intermediate class files,”), the non-local library file pointed in response to the import condition according with the preset condition into the Dart code for compilation (Paragraph [0067, 0069] “compiling unit 23 configured to compile the intermediate class files to obtain target data (i.e., non-local)… an acquiring module 211 configured to acquire a file name suffix of each of the files to be compiled in the project to be complied”). Therefore, it would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention was made to incorporate the method of importing, in response to the assigned value for the import condition according with a preset condition, the non-local library file pointed in response to the import condition according with the preset condition into the Dart code for compilation as taught by ZHAO into the method of suggesting for the missing include files as taught by Perez Acosta. The modification would be obvious because of one of ordinary skill in the art would be motivated to add/incorporate the features of importing, in response to the assigned value for the import condition according with a preset condition, the non-local library file pointed in response to the import condition according with the preset condition into the Dart code for compilation to provide an efficient technique for mapping a non-local file or external file for the missing file so as to avoid any potential errors and repeated compilation to save the time of processing as suggested by (paragraph [0002]). 14. (New) The method according to claim 13, said acquiring information on an import condition in the import sentence comprises: acquiring an import condition that begins with a preset character string in the import sentence (Paragraph [0069] “acquiring module 211 configured to acquire a file name suffix of each of the files to be compiled in the project to be complied”). Per claim 15 and 16: Perez Acosta discloses: 15. (New) The method according to claim 13, further comprising, prior to said searching for the assigned value for the import condition from the pre-obtained assigned values for the conditions in the Dart code: reading the assigned values for the conditions in the Dart code from a pre-obtained configuration file of the project (note here that the condition is error to fix and the value for the condition is file string that will fix the error, see Paragraph [0030] “The file pch.h 224 and the file string 225 will be suggested as a potential error fix. The file xstring 226 will also appear in the list of suggestions. FIG. 1i illustrates suggestions 251 in a display 250 for correcting the missing #include statement comprising the #include statement that defines string”). Per claim 17 and 18: Perez Acosta discloses: 17. (New) The method according to claim 13, further comprising, prior to said searching for the assigned value for the import condition from the pre-obtained assigned values for the conditions in the Dart code: displaying a command input interface to a user (Paragraph [0034,0047] “program development tool 122, an editor such as editor 105, one or more external files such as external files 126… input program source code such as source code 124 and correction suggestions display 128… user can enter commands or information into the computer 512 through an input device(s) 536”); and acquiring the assigned values for the conditions in the Dart code configured by the user on the command input interface (note here that the condition is error to fix and the value for the condition is file string that will fix the error, see Paragraph [0030] “The file pch.h 224 and the file string 225 will be suggested as a potential error fix. The file xstring 226 will also appear in the list of suggestions. FIG. 1i illustrates suggestions 251 in a display 250 for correcting the missing #include statement comprising the #include statement that defines string”). Per claim 19 and 20: Perez Acosta discloses: 19. (New) The method according to claim 17, further comprising, subsequent to said acquiring the assigned values for the conditions in the Dart code configured by the user on the command input interface: updating the assigned values for the conditions acquired from the command input interface to the configuration file of the object (Paragraph [004] “program development tools may provide real time updated information about program elements and may provide other means to help the development of the program such as providing compilation errors and warnings, etc. as the developer is writing the program in the editor”). Claims 21-28 is/are the apparatus/system claim corresponding to method claims 13-20 respectively, and rejected under the same rational set forth in connection with the rejection of claims 13-20 respectively, as noted above. Claims 29-32 is/are the apparatus/system claim corresponding to method claims 13-16 respectively, and rejected under the same rational set forth in connection with the rejection of claims 13-16 respectively, as noted above. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Related cited arts: Uesbeck, Phillip Merlin. On The Human Factors Impact of Polyglot Programming on Programmer Productivity. Diss. University of Nevada, Las Vegas, 2019. pp.1-190. Zaytsev, Vadim. "Software language engineers’ worst nightmare." Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering. 2020. pp. 72-85. Hattori, Momoko, et al. "Semi-static type, shape, and symbolic shape inference for dynamic computation graphs." Proceedings of the 4th ACM SIGPLAN International Workshop on Machine Learning and Programming Languages. 2020.pp. 11-19. US9811321 - Systems and methods are described for utilizing script chunks in client-side browsing applications. A script chunking service divides scripts into smaller portions, and generates precompiled chunks of code that correspond to the portions. The service may then request compilation of only those portions of a script that do not have a corresponding precompiled chunk. Portions may be determined based on length, script keywords, or other criteria, and chunks may be identified by applying a hashing function to the portions. Scripts may be filtered to identify differing portions of source code that compile to functionally identical instructions, and the chunking service may use supplemental hashes, hashes of hashes, and complier state information to facilitate identification and compilation of precompiled chunks. US10747511 - As a memory usage optimization, a compiler identifies coroutines whose activation frames can be allocated on a caller's stack instead of allocating the frame on the heap. For example, when the compiler determines that a coroutine C's life cannot extend beyond the life of the routine R that first calls the coroutine C, the compiler generates code to allocate the activation frame for C on the stack of R, instead of generating code to allocate C's frame from heap memory. In some cases, as another optimization, code for coroutine C is also inlined with code for the routine R that calls C. Coroutine activation frame content variations and layout variations are also described. US20180300218 - Disclosed technology for accurate translation of elements in a web application includes systems and methods of efficiently debugging translations for error-free localization, including using a translation debugger; comparing a source language file and a translated language file of string properties and other elements of a UI; and generating in a WYSIWYG panel of the UI, visual coding of the string properties and the other elements. The visual coding distinguishes among characteristics relating to translation states, accepting edits to string properties in a string property edit pane, displaying modified string properties in the WYSIWYG panel, and exporting an ad hoc changes list produced by the edits. Characteristics relating to translation states include string properties modified during prior debugging sessions, string properties added or modified by on-the-fly edits during debugging, distinct marking of translated string properties, string properties intended to be but not translated, and other elements not intended to be translated. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Satish Rampuria whose telephone number is 571-272-3732. The examiner can normally be reached on Monday-Friday from 8:30 AM to 5:00 PM. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Chat Do, can be reached at telephone number 571-272-3721. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. 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) Form at https://www.uspto.gov/patents/uspto-automated- interview-request-air-form. 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. /Satish Rampuria/Primary Examiner, Art Unit 2193 *****
Read full office action

Prosecution Timeline

Jun 06, 2024
Application Filed
Jun 29, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681839
OVERALL SYSTEM AND PROCESSES FOR CLUSTER FILE SYSTEM SERVICEABILITY
2y 5m to grant Granted Jul 14, 2026
Patent 12675267
PROGRAM CODE OPTIMIZATION USING ITERATIVE APPLICATION OF MACHINE LEARNING MODEL
2y 7m to grant Granted Jul 07, 2026
Patent 12663968
AUTOMATIC VALIDATION OF COMPUTER-GENERATED CODE METHOD AND APPARATUS
2y 9m to grant Granted Jun 23, 2026
Patent 12645573
INTEGRATION TESTING QUALITY
2y 5m to grant Granted Jun 02, 2026
Patent 12619404
DATA PROCESSING METHODS AND APPARATUSES, DEVICES, AND STORAGE MEDIUMS
2y 6m to grant Granted May 05, 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
89%
Grant Probability
99%
With Interview (+25.1%)
2y 11m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 846 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